Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

RAMSEY-TYPE PROBLEM FOR AN ALMOST MONOCHROMATIC K4.

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • نبذة مختصرة :
      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. [ABSTRACT FROM AUTHOR]