Random lifts of K₅setminus e are 3-colourable
classification
🧮 math.CO
keywords
randomnumberchromaticliftsalmostasymptoticallyfollowingsetminus
read the original 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 $h$-lifts of $K_5$ asymptotically (for $h\to\infty$) almost surely equal to a single number? In this paper, we offer the following partial result: The chromatic number of a random lift of $K_5\setminus e$ is asymptotically almost surely three.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.