The Ramsey number r(C7,C7,C7)

DOI10.7151/DMGT.1191zbMATH Open1049.05055OpenAlexW2327268113MaRDI QIDQ4458976FDOQ4458976

Ralph Faudree, Annette Schelten, Ingo Schiermeyer

Publication date: 25 March 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1191

zbMATH Keywords

cyclesextremal graphsRamsey numbersmulticolor Ramsey numbers

Mathematics Subject Classification ID

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

Cited In (6)

• Gallai-Ramsey numbers of \(C_7\) with multiple colors
• Title not available (Why is that?)
• New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
• The mixed irredundant Ramsey numberst(3, 7) = 18 andt(3, 8) = 22
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• The Ramsey numbers \(R(C_m,K_7)\) and \(R(C_7,K_8)\) 👍 👎
• Multicolor Ramsey Numbers for Paths and Cycles 👍 👎
• On the multi-colored Ramsey numbers of cycles 👍 👎
• New upper bound for multicolor Ramsey number of odd cycles 👍 👎
• The Cycle-Complete Graph Ramsey Number r(C₅, K₇) 👍 👎

This page was built for publication: The Ramsey number r(C₇,C₇,C₇)

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