Ramsey-type problem for an almost monochromatic K4
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.