A new class of RamseyTurn problems
We introduce and study a new class of RamseyTurn problems, a typical example of which is the following one: Let ε>0 and G be a graph of sufficiently large order n with minimum degree δ(G)>3n4. If the edges of G are colored in blue or red, then for all k∈[4,⌊(18-ε) n⌋], there exists a monochromatic cycle of length k. © 2010 Elsevier B.V. All rights reserved.
Li, H., Nikiforov, V., & Schelp, R. (2010). A new class of RamseyTurn problems. Discrete Mathematics, 310 (24), 3579-3583. https://doi.org/10.1016/j.disc.2010.09.009