On the Erdős-Hajnal problem for 3-uniform hypergraphs

DOI10.1134/S000143461311031XzbMath1294.05068MaRDI QIDQ2440004

I. A. Akolzin

Publication date: 26 March 2014

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

zbMATH Keywords

hypergraphcoloring\(n\)-uniform hypergraph

Mathematics Subject Classification ID

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

Cites Work

• What we know and what we do not know about Turán numbers
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• On a property of families of sets
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Erdős-Hajnal problem for 3-uniform hypergraphs