Edge colorings of the complete graph \(K _{149}\) and the lower bounds of three Ramsey numbers

DOI10.1016/S0166-218X(02)00245-7zbMath1009.05097MaRDI QIDQ1861572

Wenlong Su, Haipeng Luo, Guiqing Li

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numberedge coloringlower boundcirculant graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (1)

New lower bounds for seven classical Ramsey numbers \(R(3,q)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Ramsey numbers R(3,8) and R(3,9)
• New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
• Lower bounds for multicolor classical Ramsey numbers \(R\overbrace{(q, q,\dots, q)}^n\)
• The value of the Ramsey numberr(3, 8)
• New lower bounds of classical Ramsey numbers \(R(4,12)\), \(R(5,11)\) and \(R(5,12)\).

This page was built for publication: Edge colorings of the complete graph \(K _{149}\) and the lower bounds of three Ramsey numbers