The Ramsey numbers R(C_m,K₇) and R(C₇,K₈)
From MaRDI portal
Publication:925037
DOI10.1016/J.EJC.2007.05.007zbMATH Open1154.05044OpenAlexW1504442794MaRDI QIDQ925037FDOQ925037
Authors: Yaojun Chen, Yunqing Zhang, T. C. Edwin Cheng
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
Recommendations
- The Ramsey number \(R(C_8,K_8)\)
- The cycle-complete graph Ramsey number \(r(C_6,K_8)\leq 38\)
- The cycle-complete graph Ramsey number \(r(C_8,K_7)\)
- The Ramsey number for a cycle of length six versus a clique of order eight
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
Cites Work
- Graph theory
- Note on Hamilton Circuits
- 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
- On cycle—Complete graph ramsey numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- All cycle‐complete graph Ramsey numbers r(Cm, K6)
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
Cited In (12)
- Ramsey numbers of cycles versus general graphs
- \(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\)
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
- The Ramsey number for a cycle of length six versus a clique of order eight
- Ramsey numbers and the Zarankiewicz problem
- The mixed irredundant Ramsey numberst(3, 7) = 18 andt(3, 8) = 22
- The Ramsey number r(C7,C7,C7)
- The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
- Multicolor star-critical Ramsey numbers and Ramsey-good graphs
- The Ramsey number \(R(C_8,K_8)\)
- Ramsey goodness of cycles
- All Ramsey Numbers r(K 3, G) for Connected Graphs of Order 7 and 8
This page was built for publication: The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925037)