On the asymptotic value of the choice number of complete multi‐partite graphs

DOI10.1002/jgt.20137zbMath1098.05030arXivmath/0409134OpenAlexW2951825534MaRDI QIDQ5471010

Michael Krivelevich, Nurit Gazit

Publication date: 6 June 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

complete bipartite graphlist-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Improper Choosability and Property B ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ On a generalization of Rubin's theorem ⋮ Choosability with Separation of Complete Multipartite Graphs and Hypergraphs ⋮ On the choice number of complete multipartite graphs with part size four ⋮ Circular choosability

Cites Work

• Choice Numbers of Graphs: a Probabilistic Approach

This page was built for publication: On the asymptotic value of the choice number of complete multi‐partite graphs