On the Ramsey numbers R(3,8) and R(3,9)

DOI10.1016/0095-8956(82)90055-7zbMath0497.05043OpenAlexW2006722429MaRDI QIDQ1170201

Charles M. Grinstead, Sam M. Roberts

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90055-7

zbMATH Keywords

classical Ramsey numberedge-2-coloring

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (12)

THE IRREDUNDANT RAMSEY NUMBER s(3,6) ⋮ The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) ⋮ On the average size of independent sets in triangle-free graphs ⋮ Unnamed Item ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ On the Ramsey numbers for stars versus complete graphs ⋮ New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14) ⋮ Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory ⋮ Difference Ramsey numbers and Issai numbers ⋮ Idiosynchromatic poetry ⋮ Edge colorings of the complete graph \(K _{149}\) and the lower bounds of three Ramsey numbers ⋮ An invariant for minimum triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on Ramsey numbers
• Sum-free sets and Ramsey numbers
• On an unknown Ramsey number
• Construction of Special Edge-Chromatic Graphs
• Upper bounds for some Ramsey numbers
• Some graph theoretic results associated with Ramsey's theorem
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: On the Ramsey numbers R(3,8) and R(3,9)