The Ramsey number for a cycle of length six versus a clique of order eight

DOI10.1016/j.dam.2008.04.014zbMath1159.05033OpenAlexW1994261183MaRDI QIDQ1003750

Ran Xu, Yaojun Chen, Cheng, T. C. Edwin

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.014

zbMATH Keywords

cycleRamsey numbercomplete graphgoodness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey numbers for a cycle of length six or seven versus a clique of order seven
• The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\)
• All Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• The value of the Ramsey numberr(3, 8)
• On cycle—Complete graph ramsey numbers
• All cycle‐complete graph Ramsey numbers r(C_m, K₆)

This page was built for publication: The Ramsey number for a cycle of length six versus a clique of order eight