On the Erdős-Hajnal problem for 3-graphs

DOI10.1007/s10958-021-05352-zzbMath1464.05273OpenAlexW3154533856MaRDI QIDQ2027318

Danila Cherkashin

Publication date: 26 May 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05352-z

zbMATH Keywords

Turán numberErdős conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Erdős-Hajnal problem for \(H\)-free hypergraphs

Cites Work

• Unnamed Item
• Hypergraphs with high chromatic number
• The inducibility of graphs
• What we know and what we do not know about Turán numbers
• Greedy colorings of uniform hypergraphs
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Regular Behavior of the Maximal Hypergraph Chromatic Number
• A note on random greedy coloring of uniform hypergraphs
• On a property of families of sets
• Colorings of hypergraphs with large number of colors

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