Skip to main content
Article thumbnail
Location of Repository

Asymptotically the List Colouring Constants Are 1

By Bruce Reed and Benny Sudakov


In this paper we prove the following result about vertex list colourings, which shows that a conjecture from [9] is asymptotically correct. Let G be a graph with the sets of lists S(v), satisfying that for every vertex jS(v)j = (1+o(1))d and for each colour c 2 S(v), the number of neighbours of v that have c in their list is at most d. Then there exist a proper colouring of G from these lists

OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.