Cycles Are Strongly Ramsey-Unsaturated

DOI10.1017/S0963548314000212zbMath1333.05198arXiv1203.2259OpenAlexW3104854165MaRDI QIDQ5495678

Jozef Skokan, Maya Jakobine Stein

Publication date: 6 August 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.2259

zbMATH Keywords

cycleRamsey numberpathchordregularity method

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• On two problems in graph Ramsey theory
• The Ramsey number of a graph with bounded maximum degree
• All Ramsey numbers for cycles in graphs
• On multicolor Ramsey numbers for complete bipartite graphs
• Ramsey-goodness -- and otherwise
• Ramsey numbers for cycles in graphs
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• Dependent random choice
• Ramsey unsaturated and saturated graphs
• On graphs with linear Ramsey numbers
• A multipartite Ramsey number for odd cycles
• On bipartite graphs with linear Ramsey numbers

This page was built for publication: Cycles Are Strongly Ramsey-Unsaturated