Ramsey-type problem for an almost monochromatic K_4

Simple item page
dc.creatorFox, Jacob
dc.creatorSudakov, Benny
dc.date2007-10-30
dc.date.accessioned2026-07-07T08:39:25Z
dc.date.available2026-07-07T08:39:25Z
dc.descriptionIn 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/0710.5571
dc.identifierhttp://arxiv.org/abs/0710.5571
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141067
dc.subjectCombinatorics
dc.titleRamsey-type problem for an almost monochromatic K_4
dc.typetext

Files

Collections

arXiv