|
Description: |
Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let $\phi_{k}(n,H)$ be the smallest number t, such that , any graph G of order n and any colouring of its edges with k colours, admits a monochromatic H-decomposition with at most t parts. I will study the function $\phi_{k}(n,Kr)$ for k≥ 2 and r≥ 3.
This is joint work with Henry Liu.
|
