Corpus ID: 117520059

List colouring of graphs with at most $\big(2-o(1)\big)\chi$ vertices

@article{Reed2003ListCO,
  title={List colouring of graphs with at most \$\big(2-o(1)\big)\chi\$ vertices},
  author={Bruce A. Reed and Benny Sudakov},
  journal={arXiv: Combinatorics},
  year={2003}
}
Ohba has conjectured \cite{ohb} that if the graph $G$ has $2\chi(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<\epsilon<1$, there exist an $n_0=n_0(\epsilon)$ such that the list chromatic number of $G$ equals its chromatic number, provided $$n_0 \leq |V(G) | \le (2-\epsilon)\chi(G).$$ 

References

SHOWING 1-5 OF 5 REFERENCES
On chromatic-choosable graphs
A graph is chromatic-choosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph G, if we join a sufficiently large complete graph to G, thenExpand
Restricted colorings of graphs
Abstract The problem of properly coloring the vertices (or edges) of a graph using for each vertex (or edge) a color from a prescribed list of permissible colors, received a considerable amount ofExpand
Graph Coloring Problems
Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect Graphs. Geometric and Combinatorial Graphs. Algorithms.Expand
Graph Colouring and the Probabilistic Method
The term Probabilistic Method refers to the proof of deterministic statements using probabilistic tools. The method has been successfully applied to a number of problems in the field of graphExpand
Combinatorial problems and exercises
Problems Hints Solutions Dictionary of the combinatorial phrases and concepts used Notation Index of the abbreviations of textbooks and monographs Subject index Author index Errata.