Two Erdős-Hajnal-type theorems in hypergraphs

DOI10.1016/j.jctb.2020.03.001zbMath1457.05112arXiv1805.07781OpenAlexW3011897914MaRDI QIDQ2221933

Mykhaylo Tyomkyn, Asaf Shapira, Michal Amir

Publication date: 3 February 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.07781

zbMATH Keywords

Ramsey theoryhypergraphsErdős-Hajnal theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items

On 3‐graphs with no four vertices spanning exactly two edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large almost monochromatic subsets in hypergraphs
• Erdős-Hajnal-type theorems in hypergraphs
• Ramsey-type theorems
• On universality of graphs with uniformly distributed edges
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• On extremal problems of graphs and generalized graphs
• The Erdös-Hajnal Conjecture-A Survey
• Complete Partite subgraphs in dense hypergraphs
• Hypergraph Ramsey numbers
• A Ramsey-Type Theorem for Orderings of a Graph
• Quasi-random hypergraphs
• Graphs with many r -cliques have large complete r -partite subgraphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• On a problem of K. Zarankiewicz
• Induced Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs