Title of article
A new class of Ramsey–Turán problems
Author/Authors
Li، نويسنده , , H. and Nikiforov، نويسنده , , V. and Schelp، نويسنده , , R.H.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
5
From page
3579
To page
3583
Abstract
We introduce and study a new class of Ramsey–Turán problems, a typical example of which is the following one:
> 0 and G be a graph of sufficiently large order n with minimum degree δ ( G ) > 3 n / 4 . If the edges of G are colored in blue or red, then for all k ∈ [ 4 , ⌊ ( 1 / 8 − ε ) n ⌋ ] , there exists a monochromatic cycle of length k .
Keywords
Ramsey–Tur?n problems , minimum degree , Monochromatic cycles
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599533
Link To Document