Ramsey-type problem for an almost monochromatic K_4
Combinatorics
2007-10-31 v1
Abstract
In this short note we prove that there is a constant 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.
Keywords
Cite
@article{arxiv.0710.5571,
title = {Ramsey-type problem for an almost monochromatic K_4},
author = {Jacob Fox and Benny Sudakov},
journal= {arXiv preprint arXiv:0710.5571},
year = {2007}
}
Comments
9 pages