On general two-colorings of uniform hypergraphs

DOI10.1134/S1064562409060143zbMATH Open1285.05068OpenAlexW2122859486MaRDI QIDQ845499FDOQ845499

Authors: A. P. Rozovskaya 

Publication date: 29 January 2010

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

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

Mathematics Subject Classification ID

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

Cites Work

• On a property of families of sets
• Improved bounds and algorithms for hypergraph 2-coloring
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• On a combinatorial problem. II

Cited In (6)

• 2-colorings of hypergraphs with large girth
• Extremal problems in hypergraph colourings
• On balanced colorings of hypergraphs
• Upper bound in the Erdős-Hajnal problem of hypergraph coloring
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

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

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