The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
From MaRDI portal
Publication:925037
DOI10.1016/j.ejc.2007.05.007zbMath1154.05044OpenAlexW1504442794MaRDI QIDQ925037
Yaojun Chen, Yunqing Zhang, Cheng, T. C. Edwin
Publication date: 29 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.05.007
Related Items (5)
Multicolor star-critical Ramsey numbers and Ramsey-good graphs ⋮ The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\) ⋮ Ramsey Goodness of Cycles ⋮ The Ramsey number for a cycle of length six versus a clique of order eight ⋮ Ramsey numbers of cycles versus general graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
- All Ramsey numbers for cycles in graphs
- A note on Hamiltonian circuits
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- Note on Hamilton Circuits
- On cycle—Complete graph ramsey numbers
- All cycle‐complete graph Ramsey numbers r(Cm, K6)
This page was built for publication: The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
