Choosability in simple hypergraphs

zbMath1291.05075MaRDI QIDQ2445088

Dmitriy 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) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Choosability in simple hypergraphs