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

DOI10.1134/S1064562414070059zbMATH Open1320.05086OpenAlexW2014294448MaRDI QIDQ2353014FDOQ2353014

Authors D. 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

chromatic numberequitable coloringhypergraph

Mathematics Subject Classification ID

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

Recommendations

• Equitable Coloring ofk-Uniform Hypergraphs
• Equitable colorings of hypergraphs with \(r\) colors
• Equitable colorings of non-uniform simple hypergraphs
• Equitable colorings of hypergraphs with few edges
• scientific article; zbMATH DE number 5825874

Cites work

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

Cited in

(8)

• Strictly balanced uniform hypergraphs and generalizations of zero-one law
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• An Erdős-Gallai type theorem for uniform hypergraphs
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• Generating functions of some families of directed uniform hypergraphs
• Defective colorings on \(k\)-uniform hypergraphs
• On Motzkin-Straus type results for non-uniform hypergraphs
• Equitable hypergraph orientations

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

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