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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 823-830 |
| Number of pages | 8 |
| Journal | Combinatorics Probability and Computing |
| Volume | 17 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 2008 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics