科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce and study a new class of Ramsey-Turan problems, a typical example of which is the following one:
Let epsilon > 0 and G be a graph of sufficiently large order n with minimum degree delta (G) > 3n/4. If the edges of Care colored in blue or red, then for all k is an element of [4. L(1/8 - epsilon) n]]. there exists a monochromatic cycle of length k.
- 出版日期2010-12-28
