The Ramsey numbers R(C_m,K₇) and R(C₇,K₈)
From MaRDI portal
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
- scientific article; zbMATH DE number 1355297 (Why is no real title available?)
- scientific article; zbMATH DE number 1556735 (Why is no real title available?)
- A note on Hamiltonian circuits
- All Ramsey numbers for cycles in graphs
- All cycle‐complete graph Ramsey numbers r(Cm, K6)
- Graph theory
- Note on Hamilton Circuits
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
- On cycle—Complete graph ramsey numbers
- The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
Cited in
(12)- All Ramsey Numbers r(K 3, G) for Connected Graphs of Order 7 and 8
- 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
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)
