When is an Almost Monochromatic K4 Guaranteed?

Suppose that n > (log k)ck , where c is a fixed positive constant. We prove that no matter how the edges of Kn are colored with k colors, there is a copy of K4 whose edges receive at most two colors. This improves the previous best bound of kc k , where c is a fixed positive constant, which follows from results on classical Ramsey numbers.

• Type: Journal
• Year: 2008
• Where: CPC
• Authors: Alexandr V. Kostochka, Dhruv Mubayi
• Keywords: CPC 2008