scientific article; zbMATH DE number 1789917

zbMath0997.05031arXivmath/0304467MaRDI QIDQ4549228

Bruce A. Reed, Benjamin Sudakov

Publication date: 7 November 2002

Full work available at URL: https://arxiv.org/abs/math/0304467

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloringprobabilistic methodlist-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (9)

Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ Ohba's conjecture for graphs with independence number five ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ On the choice number of complete multipartite graphs with part size four ⋮ List point arboricity of dense graphs ⋮ An algebraic criterion for the choosability of graphs ⋮ Some colouring problems for Paley graphs

This page was built for publication: