On balanced colorings of hypergraphs

DOI10.1007/S10958-010-0067-YzbMath1231.05140OpenAlexW1979883786MaRDI QIDQ548768

A. P. Rozovskaya, Maria V. Titova, Dmitriy A. Shabanov

Publication date: 30 June 2011

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-010-0067-y

zbMATH Keywords

hypergraph colorings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On algorithmic methods of analysis of two-colorings of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On general two-colorings of uniform hypergraphs
• On one combinatorial problem of Erdös
• On 3-chromatic hypergraphs
• On Property B of Families of Sets
• A Note on a Combinatorial Problem of ErdŐS and Hajnal
• Randomized algorithms for colourings of hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• Extremal problems for colourings of uniform hypergraphs
• On a property of families of sets
• On a combinatorial problem. II

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