New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)

DOI10.1016/S0893-9659(99)00089-0zbMATH Open0939.05061MaRDI QIDQ1808443FDOQ1808443

Authors: Wenlong Su, Haipeng Luo, Yun-Qiu Shen 

Publication date: 5 April 2000

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

zbMATH Keywords

lower boundsRamsey numberscyclic graphs

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites Work

• Title not available (Why is that?)
• Combinatorial Relations and Chromatic Graphs
• On graphs with linear Ramsey numbers
• Title not available (Why is that?)
• R(4, 5) = 25
• On the Ramsey numbers R(3,8) and R(3,9)
• Some graph theoretic results associated with Ramsey's theorem
• The value of the Ramsey numberr(3, 8)
• Construction of Special Edge-Chromatic Graphs
• A lower bound for r(5, 5)
• A uniqueness theorem for edge-chromatic graphs
• Applying tabu search to determine new Ramsey graphs
• New lower bounds of eigth classical multicolor Ramsey numbers
• New Ramsey Bounds from Cyclic Graphs of Prime Order
• New lower bounds of classical Ramsey numbers \(R(4,12)\), \(R(5,11)\) and \(R(5,12)\).

Cited In (2)

• New lower bounds for seven classical Ramsey numbers \(R(3,q)\)
• Edge colorings of the complete graph \(K _{149}\) and the lower bounds of three Ramsey numbers

This page was built for publication: New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808443)