On two-colorings of hypergraphs

DOI10.1134/S1064562411010157MaRDI QIDQ656242zbMATH OpenOpenAlexFDO

Authors 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) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Extremal problems in hypergraph colourings
• Colorings of hypergraphs with large number of colors
• On balanced colorings of hypergraphs
• On algorithmic methods of analysis of two-colorings of hypergraphs

Cites work

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

Cited in

(5)

• On the hypercompetition numbers of hypergraphs with maximum degree at most two
• scientific article; zbMATH DE number 2140323 (Why is no real title available?)
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• On small \(n\)-uniform hypergraphs with positive discrepancy
• scientific article; zbMATH DE number 2119715 (Why is no real title available?)

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

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