The cycle-complete graph Ramsey number r(C₉, K₈)
From MaRDI portal
Publication:643174
Summary: It has been conjectured by \textit{P. Erdős} et al. [J. Graph Theory 2, 53--64 (1978; Zbl 0383.05027)] that \(r(C_m, K_n) = (m - 1)(n - 1) + 1\) for all \((m, n) \neq (3, 3)\) satisfying that \(m \geq n \geq 3\) (except \(r(C_3, K_3) = 6\)). In this paper, we prove this for the case \(m = 9\) and \(n = 8\).
Recommendations
Cites work
- All cycle‐complete graph Ramsey numbers r(Cm, K6)
- All Ramsey numbers for cycles in graphs
- scientific article; zbMATH DE number 1355297 (Why is no real title available?)
- scientific article; zbMATH DE number 1556735 (Why is no real title available?)
- scientific article; zbMATH DE number 1874380 (Why is no real title available?)
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- On cycle—Complete graph ramsey numbers
- Ramsey numbers for cycles in graphs
- The cycle-complete graph Ramsey number r(C₈,K₇)
- The cycle-complete graph Ramsey number r(C₈,K₈)
- The Cycle-Complete Graph Ramsey Number r(C5, K7)
- The Cycle-Complete Graph Ramsey Numbers
- The Ramsey number \(R(C_8,K_8)\)
- The Ramsey number for a cycle of length five vs. a complete graph of order six
- The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
Cited in
(5)
This page was built for publication: The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643174)