On Schelp's problem for three odd long cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5158529 (Why is no real title available?)
- A new class of Ramsey-Turán problems
- Large monochromatic components in edge colored graphs with a minimum degree condition
- Monochromatic cycles in 2-coloured graphs
- Ramsey numbers for cycles in graphs
- Some Ramsey-Turán type problems and related questions
- Star versus two stripes Ramsey numbers and a conjecture of Schelp
- The 3-colored Ramsey number of even cycles
- The Monochromatic Circumference of 2‐Edge‐Colored Graphs
- The Ramsey number for a triple of long even cycles
- The Ramsey numbers for a triple of long cycles
- \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
Cited in
(7)- The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
- Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
- Ramsey numbers of multiple copies of graphs in a component
- On the restricted size Ramsey number for a pair of cycles
- Large monochromatic components in 3-colored non-complete graphs
- Degree conditions for Ramsey goodness of paths
- The Oberwolfach problem and factors of uniform odd length cycles
This page was built for publication: On Schelp's problem for three odd long cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173424)