On balanced colorings of sparse hypergraphs

DOI10.1016/j.disc.2014.01.019zbMath1283.05092OpenAlexW2060268458MaRDI QIDQ2439128

Andrzej Dudek

Publication date: 7 March 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.01.019

zbMATH Keywords

sparse hypergraphsbalanced colorings

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• ``Integer-making theorems
• Obstructions for regular colorings
• A sufficient condition for equitable edge-colourings of simple graphs
• On the existence of generalized good and equitable edge colorings
• The NP-Completeness of Edge-Coloring
• Multicolour Discrepancies

This page was built for publication: On balanced colorings of sparse hypergraphs