On Schelp's problem for three odd long cycles

DOI10.1016/J.JCTB.2019.11.002zbMath1437.05116OpenAlexW2989705240MaRDI QIDQ2173424

Tomasz Łuczak, Zahra Rahimi

Publication date: 22 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2019.11.002

zbMATH Keywords

cyclesRamsey numberminimum degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Ramsey theory (05D10)

Related Items (3)

Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree ⋮ On the restricted size Ramsey number for a pair of cycles ⋮ Large monochromatic components in 3-colored non-complete graphs

Cites Work

• Unnamed Item
• Some Ramsey-Turán type problems and related questions
• 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
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• The Ramsey numbers for a triple of long cycles
• Large monochromatic components in edge colored graphs with a minimum degree condition
• Ramsey numbers for cycles in graphs
• Monochromatic Cycles in 2-Coloured Graphs
• Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs

This page was built for publication: On Schelp's problem for three odd long cycles