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

DOI10.1016/S0893-9659(99)00089-0MaRDI QIDQ1808443zbMATH OpenFDO

Authors Haipeng Luo, Yun-Qiu Shen, Wenlong Su

Publication date 5 April 2000

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

Full work available at URL https://doi.org/10.1016/S0893-9659(99)00089-0

zbMATH Keywords

cyclic graphslower boundsRamsey numbers

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Cites work

• R(4, 5) = 25
• A lower bound for r(5, 5)
• A uniqueness theorem for edge-chromatic graphs
• Applying tabu search to determine new Ramsey graphs
• Combinatorial Relations and Chromatic Graphs
• Construction of Special Edge-Chromatic Graphs
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• scientific article; zbMATH DE number 398944 (Why is no real title available?)
• New lower bounds of classical Ramsey numbers R(4,12), R(5,11) and R(5,12).
• New lower bounds of eigth classical multicolor Ramsey numbers
• New Ramsey Bounds from Cyclic Graphs of Prime Order
• On graphs with linear Ramsey numbers
• 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)

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)