A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs

DOI10.1134/S1064562414070059zbMath1320.05086OpenAlexW2014294448MaRDI QIDQ2353014

Dmitriy A. Shabanov

Publication date: 7 July 2015

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562414070059

zbMATH Keywords

hypergraphchromatic numberequitable coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• A fast algorithm for equitable coloring
• An Ore-type theorem on equitable coloring
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Random coloring method in the combinatorial problem of Erdős and Lovász
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Improved bounds and algorithms for hypergraph 2-coloring

This page was built for publication: A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs