The Ramsey numbers R(C_m,K₇) and R(C₇,K₈)

DOI10.1016/J.EJC.2007.05.007MaRDI QIDQ925037zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complete graphcycleRamsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Review text

The Ramsey number \(R(G_1,G_2)\) is the smallest integer \(n\) such that for any \(G\) of order \(n\) either \(G\) contains \(G_1\) or the complement of \(G\) contains \(G_2\). In the paper it is shown that \(R(C_m,K_7) = 6m-5\) for \(m \geq 7\) and \(R(C_7,K_8) = 43\). These results confirm the conjecture of \textit{P. Erdős}, \textit{R.J. Faudree}, \textit{C.C. Rousseau}, and \textit{R.H. Schelp} [J. Graph Theory 2, 53--64 (1978; Zbl 0383.05027)].

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₈,K₇)
• 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

• A note on Hamiltonian circuits
• All cycle‐complete graph Ramsey numbers r(C_m, K₆)
• All Ramsey numbers for cycles in graphs
• Graph theory
• scientific article; zbMATH DE number 1355297 (Why is no real title available?)
• scientific article; zbMATH DE number 1556735 (Why is no real title available?)
• 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)

• The Ramsey number for a cycle of length six versus a clique of order eight
• The Ramsey number \(R(C_8,K_8)\)
• The mixed irredundant Ramsey numberst(3, 7) = 18 andt(3, 8) = 22
• All Ramsey Numbers r(K 3, G) for Connected Graphs of Order 7 and 8
• The Ramsey number r(C₇,C₇,C₇)
• Multicolor star-critical Ramsey numbers and Ramsey-good graphs
• Ramsey goodness of cycles
• Ramsey numbers of cycles versus general graphs
• \(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\)
• The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\)
• Ramsey numbers and the Zarankiewicz problem
• The Ramsey numbers for a cycle of length six or seven versus a clique of order seven

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)