Upper bound in the Erdős-Hajnal problem of hypergraph coloring

DOI10.1134/S0001434613010197zbMath1276.05047OpenAlexW2073472609MaRDI QIDQ1947784

S. M. Teplyakov

Publication date: 26 April 2013

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph coloring

Mathematics Subject Classification ID

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

Related Items (5)

On algorithmic methods of analysis of two-colorings of hypergraphs ⋮ On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ 2-colorings of hypergraphs with large girth ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) ⋮ On small \(n\)-uniform hypergraphs with positive discrepancy

Cites Work

• Unnamed Item
• Unnamed Item
• On two-colorings of hypergraphs
• On general two-colorings of uniform hypergraphs
• On one combinatorial problem of Erdös
• Extremal problems for colourings of uniform hypergraphs
• On a property of families of sets

This page was built for publication: Upper bound in the Erdős-Hajnal problem of hypergraph coloring