Annals of Mathematics · 2009 · 156 citations · 3 references
Constant CGraph TheoryNew Upper BoundCombinatorial DesignCombinatorial Design TheoryExtremal CombinatoricsEnumerative CombinatoricsDiagonal Ramsey NumbersDiscrete MathematicsExtremal Graph Theory
We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant C such that r.
3
Fan Chung, Ronald Graham, R. Wilson · COMBINATORICA · 1989 · 474 citations
An upper bound for some ramsey numbers
Andrew Thomason · Journal of Graph Theory · 1988 · 52 citations