Diagonal Ramsey via effective quasirandomness

DOI10.1215/00127094-2022-0048MaRDI QIDQ6046448zbMATH OpenOpenAlexFDO

Authors Ashwin Sah

Publication date 11 May 2023

Published in Duke Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey numbersquasirandomnessgraphons

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Abstract: We improve the upper bound for diagonal Ramsey numbers to [R(k+1,k+1)leexp(-c(log k)^2)�inom{2k}{k}] for $kge3$. To do so, we build on a quasirandomness and induction framework for Ramsey numbers introduced by Thomason and extended by Conlon, demonstrating optimal "effective quasirandomness" results about convergence of graphs. This optimality represents a natural barrier to improvement.

Recommendations

• A new upper bound for diagonal Ramsey numbers
• Tidier examples for lower bounds on diagonal Ramsey numbers
• Ramsey numbers and bipartite Ramsey numbers via quasi-random graphs
• Lower bounds for small diagonal Ramsey numbers
• scientific article; zbMATH DE number 3946178

Cites work

• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4029619 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• A new upper bound for diagonal Ramsey numbers
• A relative Szemerédi theorem
• A reverse Sidorenko inequality
• An upper bound for some ramsey numbers
• Asymptotic lower bounds for Ramsey functions
• Extremal regular graphs: independent sets and graph homomorphisms
• Extremal results for random discrete structures
• Extremal results in sparse pseudorandom graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Independent sets in hypergraphs
• Lower bounds of tower type for Szemerédi's uniformity lemma
• On the KŁR conjecture in random graphs
• Quasi-random graphs
• Recent developments in graph Ramsey theory
• Some remarks on the theory of graphs
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• The hypergraph regularity method and its applications
• The sparse regularity lemma and its applications

Cited in

(17)

• Computation of new diagonal graph Ramsey numbers
• Off-diagonal book Ramsey numbers
• The minimum degree of minimal Ramsey graphs for cliques
• On a diagonal conjecture for classical Ramsey numbers
• Ramsey numbers for multiple copies of sparse graphs
• Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
• A new upper bound for diagonal Ramsey numbers
• Ramsey numbers of cliques versus monotone paths
• On the use of senders for asymmetric tuples of cliques in Ramsey theory
• Ramsey functions for quasi-progressions
• F$F$‐factors in Quasi‐random Hypergraphs
• Ramsey numbers of sparse digraphs
• Lower bounds for multicolor Ramsey numbers
• Threshold Ramsey multiplicity for odd cycles
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• The pigeonhole principle and multicolor Ramsey numbers
• Interview with David Conlon

This page was built for publication: Diagonal Ramsey via effective quasirandomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046448)