A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)

DOI10.1006/jctb.1993.1013zbMath0769.05066OpenAlexW2032197527MaRDI QIDQ1204480

Richard Cleve, Paul Dagum, Fan R. K. Chung

Publication date: 10 March 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1013

zbMATH Keywords

Ramsey numberconstructive lower bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (7)

Tough Ramsey graphs without short cycles ⋮ A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\) ⋮ Constructive bounds for a Ramsey-type problem ⋮ Lovász, Vectors, Graphs and Codes ⋮ Some remarks on Hajós' conjecture ⋮ New lower bounds for seven classical Ramsey numbers \(R(3,q)\) ⋮ On Some Open Questions for Ramsey and Folkman Numbers

This page was built for publication: A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)