%0 Journal Article %J Electronic Notes in Discrete Mathematics %D 2013 %T Monochromatic K_r-Decompositions of Graphs %A Liu, H. %A Sousa, Teresa %C Budapeste, Hungary %P 121-127 %V 43 %X

Given graphs G and H, and a coloring of the edges of G with k colors, 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 f_{k}(n,H) be the smallest number t such that any k-edge-colored graph G of order n, admits a monochromatic H-decomposition with at most t parts. Here we study the function f_{k}(n,K_r) for k ≥2 and r≥ 3.

%8 1-5 July %> https://docentes.fct.unl.pt/sites/default/files/tmjs/files/mono-clique-ep100.pdf