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

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

2003-04-28

arxiv.org/abs/math/0304467v1

Proceedings of the ICM, Beijing 2002, vol. 3, 587--604

Mathematics

Combinatorics

Scientific paper

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).$$

Affiliated with

Also associated with

No associations

Rating

List colouring of graphs with at most $\big(2-o(1)\big)χ$ vertices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with List colouring of graphs with at most $\big(2-o(1)\big)χ$ vertices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and List colouring of graphs with at most $\big(2-o(1)\big)χ$ vertices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-334013