A new upper bound for diagonal Ramsey numbers

2009/09/01 by David Conlon · 2 citations
Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Topology and Set Theory #Advanced Graph Theory Research #Mathematics #Diagonal #Ramsey's theorem #Upper and lower bounds #Combinatorics #Ramsey theory #Geometry #Mathematical analysis

paper · pdf · doi:10.4007/annals.2009.170.941

openalex publication_date 2009/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/15

Abstract

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant C such that r.

Citations

• A Combinatorial Problem in Geometry
• On a Problem of Formal Logic
• Quasi-random graphs

Cited by

• Density theorems for bipartite graphs and related Ramsey-type results
• Extremal results in sparse pseudorandom graphs
• Two remarks on the Burr–Erdős conjecture
• Ramsey's theorem [wikipedia]