List colouring of graphs with at most $\big(2-o(1)\big)χ$ vertices
| dc.creator | Reed, Bruce | |
| dc.creator | Sudakov, Benny | |
| dc.date | 2003-04-28 | |
| dc.date.accessioned | 2026-07-07T04:57:33Z | |
| dc.date.available | 2026-07-07T04:57:33Z | |
| dc.description | Ohba has conjectured \cite{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 $n_0=n_0(ε)$ such that the list chromatic number of $G$ equals its chromatic number, provided $$n_0 \leq |V(G) | \le (2-ε)χ(G).$$ | |
| dc.identifier | https://arxiv.org/abs/math/0304467 | |
| dc.identifier | http://arxiv.org/abs/math/0304467 | |
| dc.identifier | Proceedings of the ICM, Beijing 2002, vol. 3, 587--604 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67299 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15, 05D40 | |
| dc.title | List colouring of graphs with at most $\big(2-o(1)\big)χ$ vertices | |
| dc.type | text |