The cycle-complete graph Ramsey number r(C₈,K₈)

zbMATH Open1144.05042MaRDI QIDQ5454050FDOQ5454050

Authors: M. M. M. Jaradat, B. M. N. Alzaleq 

Publication date: 3 April 2008

Recommendations

• The cycle-complete graph Ramsey number \(r(C_8,K_7)\)
• The Ramsey number \(R(C_8,K_8)\)
• The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
• All cycle‐complete graph Ramsey numbers r(C_m, K₆)
• The cycle-complete graph Ramsey number \(r(C_6,K_8)\leq 38\)

zbMATH Keywords

cyclesRamsey numbercomplete graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Cited In (6)

• The Ramsey number for a cycle of length six versus a clique of order eight
• The cycle-complete graph Ramsey numbers \(R(C_n,K_8)\), for \(10\le n\le 15\)
• The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
• The Ramsey number \(R(C_8,K_8)\)
• The cycle-complete graph Ramsey number \(r(C_8,K_7)\)
• All Ramsey Numbers r(K 3, G) for Connected Graphs of Order 7 and 8

This page was built for publication: The cycle-complete graph Ramsey number \(r(C_8,K_8)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5454050)