Random lifts of K5∖eK_5\setminus e are 3-colourable

preprint2011arXivOpen access

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 hh-lifts of K5K_5 asymptotically (for h→∞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 K5∖eK_5\setminus e is asymptotically almost surely three.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.