2007/10/30 by Fox, Jacob, Sudakov, Benny
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.0710.5571
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n > 2ck contains a K4 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.