Short proofs of some extremal results. III
From MaRDI portal
Publication:3386524
DOI10.1002/RSA.20953zbMATH Open1454.05056arXiv1910.08661OpenAlexW3081713386WikidataQ113913010 ScholiaQ113913010MaRDI QIDQ3386524FDOQ3386524
Authors: David Conlon, Jacob Fox, Benny Sudakov 
Publication date: 5 January 2021
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Abstract: We prove a selection of results from different areas of extremal combinatorics, including complete or partial solutions to a number of open problems. These results, coming mainly from extremal graph theory and Ramsey theory, have been collected together because in each case the relevant proofs are reasonably short.
Full work available at URL: https://arxiv.org/abs/1910.08661
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Random graphs.
- Multiplicative number theory. I. Classical theory
- Title not available (Why is that?)
- Norm-graphs and bipartite Turán numbers
- On sets of integers containing k elements in arithmetic progression
- The Ramsey number R(3, t) has order of magnitude t2/log t
- A note on Ramsey numbers
- Problems and results in extremal combinatorics. I.
- Title not available (Why is that?)
- Problems and results in extremal combinatorics. III.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Sets of Acquaintances and Strangers at any Party
- The concentration of the chromatic number of random graphs
- Short proofs of some extremal results
- Coloring graphs with sparse neighborhoods
- On a Ramsey type theorem
- Extremal problems concerning transformations of the edges of the complete hypergraphs
- Dependent random choice
- Short proofs of some extremal results. II.
- Hypergraph packing and sparse bipartite Ramsey numbers
- On Hadwiger's Number and the Stability Number
- On graphs with linear Ramsey numbers
- A conjecture of Erdős on graph Ramsey numbers
- Induced Ramsey-type theorems
- Problems and results in extremal combinatorics. II
- Density theorems for bipartite graphs and related Ramsey-type results
- Combinatorial theorems relative to a random set
- Two remarks on the Burr-Erdős conjecture
- Induced Ramsey numbers
- Title not available (Why is that?)
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Joints in graphs
- On the number of complete subgraphs and circuits contained in graphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- On the Ramsey multiplicity of complete graphs
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
- Title not available (Why is that?)
- On the Ramsey multiplicities of graphs—problems and recent results
- Turánnical hypergraphs
- There exist graphs with super‐exponential Ramsey multiplicity constant
- On a theorem of Rademacher-Turán
- Books versus triangles
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- Sub-Ramsey numbers of arithmetic progressions
- Books in graphs
- Large joints in graphs
- Complete minors and independence number
- Recent developments in graph Ramsey theory
- The Ramsey number of dense graphs
- On the method of typical bounded differences
- On the multicolor Ramsey number of a graph with \(m\) edges
- Connected matchings and Hadwiger's conjecture
- An infinite Sidon sequence
- Hedgehogs are not colour blind
- Books versus triangles at the extremal density
Cited In (8)
- Problems and results in extremal combinatorics. III.
- Infinite Sperner's theorem
- Short proofs of some extremal results. II.
- Ramsey numbers with prescribed rate of growth
- Short proofs of some extremal results
- Graphs with arbitrary Ramsey number and connectivity
- Ramsey non-goodness involving books
- Ramsey numbers upon vertex deletion
This page was built for publication: Short proofs of some extremal results. III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386524)
