Multipartite Ramsey numbers for odd cycles

DOI10.1002/jgt.20364zbMath1179.05072OpenAlexW4234441112WikidataQ114236187 ScholiaQ114236187MaRDI QIDQ3633004

Richard H. Schelp, Gábor N. Sárközy, András Gyárfás

Publication date: 16 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20364

zbMATH Keywords

regularity lemmaRamsey numbersmonochromatic cyclecomplete 5-partite graph

Mathematics Subject Classification ID

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

Related Items (5)

Multipartite Ramsey number of complete graphs versus matchings ⋮ The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2) ⋮ Some Ramsey-Turán type problems and related questions ⋮ A multipartite Ramsey number for odd cycles ⋮ The tripartite Ramsey number for trees

Cites Work

• Unnamed Item
• The Ramsey number for a triple of long even cycles
• All Ramsey numbers for cycles in graphs
• Tripartite version of the Corrádi-Hajnal theorem
• An algorithmic version of the blow-up lemma
• Generalized and geometric Ramsey numbers for cycles.

This page was built for publication: Multipartite Ramsey numbers for odd cycles