Erdős-Hajnal-type theorems in hypergraphs
From MaRDI portal
Publication:713978
DOI10.1016/j.jctb.2012.05.005zbMath1251.05104arXiv1104.5544OpenAlexW2145208749MaRDI QIDQ713978
Jacob Fox, David Conlon, Benjamin Sudakov
Publication date: 19 October 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.5544
Related Items
For most graphs H , most H -free graphs have a linear homogeneous set, On 3‐graphs with no four vertices spanning exactly two edges, Two Erdős-Hajnal-type theorems in hypergraphs, On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two problems in graph Ramsey theory
- An improved bound for the stepping-up lemma
- A conjecture of Erdős on graph Ramsey numbers
- Large almost monochromatic subsets in hypergraphs
- Ramsey-type theorems
- The Erdős-Hajnal conjecture for bull-free graphs
- Weak hypergraph regularity and linear hypergraphs
- Density theorems for bipartite graphs and related Ramsey-type results
- Two remarks on the Burr-Erdős conjecture
- Hypergraphs, quasi-randomness, and conditions for regularity
- Non-Ramsey graphs are \(c\log n\)-universal
- On extremal problems of graphs and generalized graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Crossing patterns of semi-algebraic sets
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
- Complete Partite subgraphs in dense hypergraphs
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Hypergraph Ramsey numbers
- On graphs with linear Ramsey numbers
- Regularity Lemma for k-uniform hypergraphs
- The Ramsey number of dense graphs
- Intersection patterns of curves
- The counting lemma for regular k‐uniform hypergraphs
- 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
- On bipartite graphs with linear Ramsey numbers