New Ramsey Bounds from Cyclic Graphs of Prime Order

DOI10.1137/S0895480196298378zbMath0884.05064OpenAlexW2068672752MaRDI QIDQ4377444

Craig A. Tovey, Neil J. Calkin, Paul Erdős

Publication date: 9 February 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480196298378

zbMATH Keywords

Ramseycyclic graphsprobabilistic bounds

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (4)

Random cyclic triangle-free graphs of prime order ⋮ Lower bounds for multicolor classical Ramsey numbers \(R\overbrace{(q, q,\dots, q)}^n\) ⋮ New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14) ⋮ On partitioning the orbitals of a transitive permutation group

This page was built for publication: New Ramsey Bounds from Cyclic Graphs of Prime Order