Title

A new class of RamseyTurn problems

Abstract

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.

Publication Title

Discrete Mathematics

Share

COinS