Informace o publikaci
A note on edge-colourings avoiding rainbow K-4 and monochromatic K-m
| Autoři | |
|---|---|
| Rok publikování | 2009 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | Electronic Journal of Combinatorics |
| Citace | |
| Popis | We study the mixed Ramsey number max R(n, K-m, K-r),defined as the maximum number of colours in an edge-colouring of the complete graph K-n, such that K-n has no monochromatic complete subgraph on m vertices and no rainbow complete subgraph on r vertices. Improving an upper bound of Axenovich and Iverson, we show that max R(n, K-m, K-4) <= n(3/2) root 2m for all m >= 3. Further, we discuss a possible way to improve their lower bound on max R(n, K-4, K-4) based on incidence graphs of finite projective planes. |