Monochromatic K_r-decompositions of graphs (extended abstract)

Research output: Other contribution


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 φ_k(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here, we study the function φ_k(n, K_r) for k ≥ 2 and r ≥ 3.
Original languageUnknown
Publication statusPublished - 1 Jan 2013

Cite this