Short proofs of some extremal results. II.
From MaRDI portal
Publication:326811
DOI10.1016/j.jctb.2016.03.005zbMath1348.05209arXiv1507.00547OpenAlexW2963382931MaRDI QIDQ326811
David Conlon, Jacob Fox, Benjamin Sudakov
Publication date: 12 October 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.00547
Generalized Ramsey theory (05C55) Ramsey theory (05D10) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
Induced Ramsey number for a star versus a fixed graph ⋮ Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} ⋮ On the Turán number of the hypercube ⋮ Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree ⋮ Ordered Ramsey numbers ⋮ Short proofs of some extremal results III
Cites Work
- Problems and results in extremal combinatorics. III.
- Small complete minors above the extremal edge density
- On two problems in graph Ramsey theory
- Sparsity. Graphs, structures, and algorithms
- Small minors in dense graphs
- A new proof of the graph removal lemma
- On Roth's theorem on progressions
- Ramsey-type theorems
- Lower bound of the Hadwiger number of graphs by their average degree
- The Ramsey number of a graph with bounded maximum degree
- The tail is cut for Ramsey numbers of cubes
- Problems and results in extremal combinatorics. II
- Density theorems for bipartite graphs and related Ramsey-type results
- Extremal problems concerning transformations of the set of edges of the complete graph
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- On the number of copies of one hypergraph in another
- Problems and results in extremal combinatorics. I.
- Ramsey numbers for sparse graphs
- The extremal function for complete minors
- Ramsey numbers of degenerate graphs
- On extremal problems of graphs and generalized graphs
- Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Turan's theorem for \(k\)-graphs
- Cube Ramsey numbers are polynomial
- Extremal problems concerning transformations of the edges of the complete hypergraphs
- Dependent random choice
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- On the structure of set-mappings
- An extremal function for contractions of graphs
- ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
- Large Subgraphs without Short Cycles
- Hypergraph Packing and Sparse Bipartite Ramsey Numbers
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- On graphs with linear Ramsey numbers
- The Induced Size-Ramsey Number of Cycles
- Logarithmically small minors and topological minors
- Short Proofs of Some Extremal Results
- On Certain Sets of Integers
- On a problem of K. Zarankiewicz
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Induced Ramsey-type theorems
- On bipartite graphs with linear Ramsey numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
