The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
From MaRDI portal
Publication:643174
DOI10.5402/2011/926191zbMath1295.05148OpenAlexW2015977355WikidataQ58690149 ScholiaQ58690149MaRDI QIDQ643174
Publication date: 28 October 2011
Published in: ISRN Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2011/926191
Cites Work
- The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
- The Ramsey number \(R(C_8,K_8)\)
- All Ramsey numbers for cycles in graphs
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On cycle—Complete graph ramsey numbers
- All cycle‐complete graph Ramsey numbers r(Cm, K6)
- The Ramsey number for a cycle of length five vs. a complete graph of order six
- The Cycle-Complete Graph Ramsey Numbers
- The Cycle-Complete Graph Ramsey Number r(C5, K7)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)