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

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 Keywords

chromatic numberequitable coloringhypergraph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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)