Random lifts of $K_5\setminus e$ are 3-colourable
Combinatorics
2011-08-02 v2
Abstract
Amit, Linial, and Matou\vsek (Random lifts of graphs III: independence and chromatic number, Random Struct. Algorithms, 2001) have raised the following question: Is the chromatic number of random -lifts of asymptotically (for ) almost surely equal to a single number? In this paper, we offer the following partial result: The chromatic number of a random lift of is asymptotically almost surely three.
Cite
@article{arxiv.1003.1527,
title = {Random lifts of $K_5\setminus e$ are 3-colourable},
author = {Babak Farzad and Dirk Oliver Theis},
journal= {arXiv preprint arXiv:1003.1527},
year = {2011}
}
Comments
10 pages, SIAM J Discrete Math