Short Proofs of Some Extremal Results

DOI10.1017/S0963548313000448zbMath1290.05089arXiv1212.1300MaRDI QIDQ5414143

Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 2 May 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1300

zbMATH Keywords

Ramsey theoryextremal combinatoricsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (15)

Spectral radius and clique partitions of graphs ⋮ An overview of graph covering and partitioning ⋮ Hilbert cubes in arithmetic sets ⋮ A lower bound on the order of the largest induced forest in planar graphs with high girth ⋮ Short proofs of some extremal results. II. ⋮ Hilbert’s Proof of His Irreducibility Theorem ⋮ Monochromatic Hilbert cubes and arithmetic progressions ⋮ Note on character sums of Hilbert cubes ⋮ Induced forests in some distance-regular graphs ⋮ Hilbert cubes meet arithmetic sets ⋮ Extremal problems in hypergraph colourings ⋮ Large induced forests in planar graphs with girth 4 ⋮ The Namer-Claimer game ⋮ Short proofs of some extremal results III ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth

Cites Work

• A conjecture of Erdős on graph Ramsey numbers
• Optimal inverse Littlewood-Offord theorems
• On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
• Problems and results in extremal combinatorics. II
• Clique partitions of complements of forests and bounded degree graphs
• Quantitative forms of a theorem of Hilbert
• Clique partitions of the cocktail party graph
• Maximum induced forests of planar graphs
• On the dimension of the Hilbert cubes
• Constructive bounds for a Ramsey-type problem
• Problems and results in extremal combinatorics. I.
• Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
• On representation problems in the additive number theory
• Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
• Large induced forests in triangle-free planar graphs
• A new lower bound for a Ramsey-type problem
• Large induced forests in sparse graphs
• A sharp inverse Littlewood-Offord theorem
• Ramsey unsaturated and saturated graphs
• Upper Bounds for Online Ramsey Games in Random Graphs
• Online Ramsey Games in Random Graphs
• Hypergraph Packing and Sparse Bipartite Ramsey Numbers
• Hypergraph Ramsey numbers
• K^s-Free Graphs Without Large K^r-Free Subgraphs
• Ramsey Games Against a One-Armed Bandit
• Large K_r‐free subgraphs in K_s‐free graphs and some other Ramsey‐type problems
• Bounding Ramsey numbers through large deviation inequalities
• On the independence number of sparse graphs
• The Ramsey number of dense graphs
• Two variants of the size Ramsey number
• The Construction of Certain Graphs

This page was built for publication: Short Proofs of Some Extremal Results