Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
From MaRDI portal
Publication:6057663
DOI10.1002/JGT.22760zbMath1522.05296arXiv2001.00643OpenAlexW3206656863MaRDI QIDQ6057663
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00643
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Vertex degrees (05C07)
Related Items (1)
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
- Generalized Ramsey theory for multiple colors
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
- The Ramsey numbers for a triple of long cycles
- On Schelp's problem for three odd long cycles
- Exact Ramsey numbers of odd cycles via nonlinear optimisation
- 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: Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree