New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
From MaRDI portal
Publication:1808443
DOI10.1016/S0893-9659(99)00089-0zbMath0939.05061MaRDI QIDQ1808443
Wenlong Su, Haipeng Luo, Yun-Qiu Shen
Publication date: 5 April 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Related Items (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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Ramsey numbers R(3,8) and R(3,9)
- Applying tabu search to determine new Ramsey graphs
- A uniqueness theorem for edge-chromatic graphs
- A lower bound for r(5, 5)
- The value of the Ramsey numberr(3, 8)
- New Ramsey Bounds from Cyclic Graphs of Prime Order
- On graphs with linear Ramsey numbers
- R(4, 5) = 25
- Construction of Special Edge-Chromatic Graphs
- Some graph theoretic results associated with Ramsey's theorem
- Combinatorial Relations and Chromatic Graphs
- New lower bounds of classical Ramsey numbers \(R(4,12)\), \(R(5,11)\) and \(R(5,12)\).
This page was built for publication: New lower bounds for classical Ramsey numbers R(5, 13) and R(5, 14)
