Short proofs of some extremal results III
From MaRDI portal
Publication:3386524
DOI10.1002/rsa.20953zbMath1454.05056arXiv1910.08661OpenAlexW3081713386WikidataQ113913010 ScholiaQ113913010MaRDI QIDQ3386524
Jacob Fox, David Conlon, Benjamin Sudakov
Publication date: 5 January 2021
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.08661
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (3)
Ramsey non-goodness involving books ⋮ Ramsey numbers with prescribed rate of growth ⋮ Infinite Sperner's theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Problems and results in extremal combinatorics. III.
- Short proofs of some extremal results. II.
- On the Ramsey multiplicity of complete graphs
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- A conjecture of Erdős on graph Ramsey numbers
- Sub-Ramsey numbers of arithmetic progressions
- Large joints in graphs
- On the multicolor Ramsey number of a graph with \(m\) edges
- On a theorem of Rademacher-Turán
- Problems and results in extremal combinatorics. II
- Density theorems for bipartite graphs and related Ramsey-type results
- Two remarks on the Burr-Erdős conjecture
- A note on Ramsey numbers
- The concentration of the chromatic number of random graphs
- Induced Ramsey numbers
- An infinite Sidon sequence
- Problems and results in extremal combinatorics. I.
- Coloring graphs with sparse neighborhoods
- Books in graphs
- Hedgehogs are not colour blind
- Joints in graphs
- On a Ramsey type theorem
- Norm-graphs and bipartite Turán numbers
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Books Versus triangles
- Complete Minors and Independence Number
- Extremal problems concerning transformations of the edges of the complete hypergraphs
- Dependent random choice
- Recent developments in graph Ramsey theory
- On Sets of Acquaintances and Strangers at any Party
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- On Hadwiger's Number and the Stability Number
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On the Ramsey multiplicities of graphs—problems and recent results
- On sets of integers containing k elements in arithmetic progression
- On graphs with linear Ramsey numbers
- Combinatorial theorems relative to a random set
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Connected matchings and Hadwiger's conjecture
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Turánnical hypergraphs
- The Ramsey number of dense graphs
- Books versus Triangles at the Extremal Density
- On the Method of Typical Bounded Differences
- Short Proofs of Some Extremal Results
- There exist graphs with super‐exponential Ramsey multiplicity constant
- On the number of complete subgraphs and circuits contained in graphs
- Induced Ramsey-type theorems
This page was built for publication: Short proofs of some extremal results III
