A multipartite Ramsey number for odd cycles

DOI10.1002/jgt.20647zbMath1254.05113OpenAlexW1532010022WikidataQ114236180 ScholiaQ114236180MaRDI QIDQ4650183

Fabrício Siqueira Benevides

Publication date: 23 November 2012

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

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

zbMATH Keywords

stabilitycyclesRamsey numberregularity lemmamultipartite

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ Cycles Are Strongly Ramsey-Unsaturated

Cites Work

• More results on Ramsey-Turán type problems
• A new class of Ramsey-Turán problems
• The Ramsey number for a triple of long even cycles
• The 3-colored Ramsey number of even cycles
• All Ramsey numbers for cycles in graphs
• Corrigendum. Three-color Ramsey numbers for paths
• Three-color Ramsey numbers for paths
• Cycles and stability
• Pancyclic graphs. I
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• Tripartite Ramsey numbers for paths
• Multipartite Ramsey numbers for odd cycles

This page was built for publication: A multipartite Ramsey number for odd cycles