On the restricted size Ramsey number for a pair of cycles

DOI10.1016/j.disc.2024.113891arXiv2208.08350WikidataQ129287722 ScholiaQ129287722MaRDI QIDQ6197749

Joanna Polcyn, Zahra Rahimi, Tomasz Łuczak

Publication date: 19 February 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

cyclesRamsey number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Ramsey number for a triple of long even cycles
• All Ramsey numbers for cycles in graphs
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• The Ramsey numbers for a triple of long cycles
• Sandwiching random graphs: universality between random graph models
• New lower bounds on the size-Ramsey number of a path
• Sandwiching dense random regular graphs between binomial random graphs
• The multicolor size-Ramsey numbers of cycles
• On Schelp's problem for three odd long cycles
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
• Monochromatic Cycles in 2-Coloured Graphs
• On size Ramsey number of paths, trees, and circuits. I
• The Induced Size-Ramsey Number of Cycles
• On the Size-Ramsey Number of Cycles
• On some Multicolor Ramsey Properties of Random Graphs
• Path Ramsey Number for Random Graphs
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree

This page was built for publication: On the restricted size Ramsey number for a pair of cycles