The Ramsey number for a cycle of length five vs. a complete graph of order six

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200010)35:2<99::AID-JGT4>3.0.CO;2-6" /><99::AID-JGT4>3.0.CO;2-6 10.1002/1097-0118(200010)35:2<99::AID-JGT4>3.0.CO;2-6zbMath0969.05044OpenAlexW4244429365MaRDI QIDQ4518335

Chula J. Jayawardene, Cecil C. Rousseau

Publication date: 6 February 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200010)35:2<99::aid-jgt4>3.0.co;2-6

zbMATH Keywords

cycleRamsey number

Mathematics Subject Classification ID

Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items (4)

On Ramsey \((mK_2,H)\)-minimal graphs ⋮ The cycle-complete graph Ramsey number \(r(C_{9}, K_{8})\) ⋮ Star-critical Ramsey numbers for cycles versus \(K_4\) ⋮ Unnamed Item

Cites Work

• All Ramsey numbers for cycles in graphs
• Asymptotic lower bounds for Ramsey functions
• Ramsey numbers for cycles in graphs
• Ramsey numbers for graphs with five vertices
• Some small ramsey numbers
• On cycle—Complete graph ramsey numbers

This page was built for publication: The Ramsey number for a cycle of length five vs. a complete graph of order six