Choosability in simple hypergraphs

MaRDI QIDQ2445088zbMATH OpenFDO

Authors D. A. Shabanov

Publication date 11 April 2014

Published in Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

random recoloring methodlist coloringshypergraphs coloringsspace hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Recommendations

• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• Hypergraph list coloring and Euclidean Ramsey theory
• Chromatic-choosability of hypergraphs with high chromatic number
• Choosability in random hypergraphs
• Colorings versus list colorings of uniform hypergraphs

Cited in

(4)

• Improper choosability and property B
• Hypergraph list coloring and Euclidean Ramsey theory
• Hypergraph extension of the Alon-Tarsi list coloring theorem
• Choosability conjectures and multicircuits

This page was built for publication: Choosability in simple hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445088)