A new type of Ramsey-Turan problems

Details A new type of Ramsey-Turan problems A new type of Ramsey-Turan problems

2010-01-13

arxiv.org/abs/1001.2078v1

Mathematics

Combinatorics

9 pages

Scientific paper

We introduce and study a new type of Ramsey-Turan problems, a typical example
of which is the following one: let c>0 and G be a graph of sufficiently large
order n with minimum degree >3n/4. If the edges of G are colored in blue or
red, then for every 3k.

Affiliated with

Also associated with

No associations

Rating

A new type of Ramsey-Turan problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new type of Ramsey-Turan problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new type of Ramsey-Turan problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524796