Article contents
When is an Almost Monochromatic K4 Guaranteed?
Published online by Cambridge University Press: 01 November 2008
Abstract
Suppose that n > (log k)ck, where c is a fixed positive constant. We prove that, no matter how the edges of Kn are coloured with k colours, there is a copy of K4 whose edges receive at most two colours. 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
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2008
References
- 7
- Cited by