Ramsey-type problem for an almost monochromatic K_4

Details Ramsey-type problem for an almost monochromatic K_4 Ramsey-type problem for an almost monochromatic K_4

2007-10-30

arxiv.org/abs/0710.5571v1

Mathematics

Combinatorics

9 pages

Scientific paper

In this short note we prove that there is a constant $c$ such that every
k-edge-coloring of the complete graph K_n with n > 2^{ck} contains a K_4 whose
edges receive at most two colors. This improves on a result of Kostochka and
Mubayi, and is the first exponential bound for this problem.

Affiliated with

Also associated with

No associations

Rating

Ramsey-type problem for an almost monochromatic K_4 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 Ramsey-type problem for an almost monochromatic K_4, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ramsey-type problem for an almost monochromatic K_4 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-364960