Item request has been placed!
×
Item request cannot be made.
×
![loading](/sites/all/modules/hf_eds/images/loading.gif)
Processing Request
RAMSEY-TYPE PROBLEM FOR AN ALMOST MONOCHROMATIC K4.
Item request has been placed!
×
Item request cannot be made.
×
![loading](/sites/all/modules/hf_eds/images/loading.gif)
Processing Request
- المؤلفون: Fox, Jacob1 ; Sudakov, Benny2
- المصدر:
SIAM Journal on Discrete Mathematics. 2009, Vol. 23 Issue 1, p155-162. 8p.
- الموضوع:
- معلومة اضافية
- نبذة مختصرة :
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]
No Comments.