Random lifts of K5 e are 3-colourable
Abstract
Amit, Linial, and Matou (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 K5 asymptotically (for h∞) almost surely equal to a single number? In this paper, we offer the following partial result: The chromatic number of a random lift of K5 e is asymptotically almost surely three.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.