TY - GEN

T1 - Monochromatic K_r-decompositions of graphs (extended abstract)

AU - Sousa, Teresa Maria Jerónimo

AU - Liu, Henry Chung Hang

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

KW - graph decompositions

KW - monochromatic graph decomposiitons

M3 - Other contribution

VL - 43

ER -