List colouring of graphs with at most (2-o(1)) vertices
Abstract
Ohba has conjectured ohb that if the graph G has 2(G)+1 or fewer vertices then the list chromatic number and chromatic number of G are equal. In this paper we prove that this conjecture is asymptotically correct. More precisely we obtain that for any 0<ε<1, there exist an n0=n0(ε) such that the list chromatic number of G equals its chromatic number, provided n0 ≤ |V(G) | (2-ε)(G).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.