On two-colorings of hypergraphs

DOI10.1134/S1064562411010157zbMath1238.05142OpenAlexW2035082269MaRDI QIDQ656242

A. B. Kulikov, Danila Cherkashin

Publication date: 17 January 2012

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

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

Mathematics Subject Classification ID

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

Related Items (2)

Upper bound in the Erdős-Hajnal problem of hypergraph coloring ⋮ On small \(n\)-uniform hypergraphs with positive discrepancy

Cites Work

• Unnamed Item
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: On two-colorings of hypergraphs