Some constructive bounds on Ramsey numbers

DOI10.1016/j.jctb.2010.01.003zbMath1200.05137OpenAlexW2149727310MaRDI QIDQ974470

Vojtěch Rödl, Pavel Pudlák, Alexandr V. Kostochka

Publication date: 3 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2010.01.003

zbMATH Keywords

classical Ramsey numbersconstructive boundssuperline graphs

Mathematics Subject Classification ID

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

Related Items

A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers \(R(3, k)\) ⋮ Some recent results on Ramsey-type numbers ⋮ A note on pseudorandom Ramsey graphs ⋮ Independent Sets in Polarity Graphs ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ Hasse diagrams with large chromatic number ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph

Cites Work

• Asymptotic lower bounds for Ramsey functions
• Polarities and \(2k\)-cycle-free graphs
• Norm-graphs: Variations and applications
• Explicit Ramsey graphs and orthonormal labelings
• Some structural properties of low-rank matrices related to computational complexity
• Explicit Concentrators from Generalized N-Gons
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• On Graphs that do not Contain a Thomsen Graph
• Constructive lower bounds for off-diagonal Ramsey numbers