The critical window for the classical Ramsey-Turán problem
From MaRDI portal
Publication:520045
DOI10.1007/S00493-014-3025-3zbMath1374.05131arXiv1208.3276OpenAlexW2070834764MaRDI QIDQ520045
Po-Shen Loh, Jacob Fox, Yufei Zhao
Publication date: 31 March 2017
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.3276
Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (8)
On the Ramsey-Turán number with small \(s\)-independence number ⋮ The Ramsey-Turán problem for cliques ⋮ Clique-factors in graphs with sublinear -independence number ⋮ K4$K_4$‐free graphs have sparse halves ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ Two results on Ramsey-Turán theory ⋮ Phase transitions in Ramsey-Turán theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two problems in graph Ramsey theory
- More results on Ramsey-Turán type problems
- A new proof of the graph removal lemma
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- How to avoid using the regularity Lemma: Pósa's conjecture revisited
- Density theorems for bipartite graphs and related Ramsey-type results
- Quick approximation to matrices and applications
- On a Ramsey-Turán type problem
- The independence number of dense graphs with large odd girth
- Lower bounds of tower type for Szemerédi's uniformity lemma
- A few remarks on Ramsey--Turán-type problems
- Bounds for graph regularity and removal lemmas
- On the Ramsey-Turán numbers of graphs and hypergraphs
- Turán-Ramsey theorems and simple asymptotically extremal structures
- Dependent random choice
- Some exact Ramsey-Turán numbers
- On Sets of Acquaintances and Strangers at any Party
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- On sets of integers containing k elements in arithmetic progression
- On graphs with linear Ramsey numbers
- On the optimality of the random hyperplane rounding technique for MAX CUT
- Pósa's conjecture for graphs of order at least 2 × 108
- Die Brunn‐Minkowskische Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie. I
- Ramsey-Turán theory
- A new proof of Szemerédi's theorem
This page was built for publication: The critical window for the classical Ramsey-Turán problem
