A new proof of the KŁR conjecture
From MaRDI portal
Publication:2161286
DOI10.1016/j.aim.2022.108518zbMath1494.05099arXiv2108.05687OpenAlexW3188814636WikidataQ113880943 ScholiaQ113880943MaRDI QIDQ2161286
Publication date: 4 August 2022
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.05687
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- On the KŁR conjecture in random graphs
- Hypergraph containers
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Random Ramsey graphs for the four-cycle
- On \(K^ 4\)-free subgraphs of random graphs
- Turán's extremal problem in random graphs: Forbidding even cycles
- Turán's extremal problem in random graphs: Forbidding odd cycles
- Counting \(H\)-free graphs
- Extremal results in sparse pseudorandom graphs
- \(K_4\)-free subgraphs of random graphs revisited
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- Turán's theorem in sparse random graphs
- K5‐free subgraphs of random graphs
- On triangle-free random graphs
- On an anti‐Ramsey threshold for sparse graphs with one triangle
- The Turn Theorem for Random Graphs
- Threshold Functions for Ramsey Properties
- Arithmetic progressions of length three in subsets of a random set
- Independent sets in hypergraphs
- Stability results for random discrete structures
- A probabilistic counting lemma for complete graphs
This page was built for publication: A new proof of the KŁR conjecture
