Monochromatic Kr‐Decompositions of Graphs |
| |
| Authors: | Henry Liu Teresa Sousa |
| |
| Affiliation: | 1. CENTRO DE MATEMáTICA E APLICA??ES, FACULDADE DE CIêNCIAS E TECNOLOGIA, UNIVERSIDADE NOVA DE LISBOA, CAPARICA, PORTUGAL;2. DEPARTAMENTO DE MATEMáTICA AND CENTRO DE MATEMáTICA E APLICA??ES, FACULDADE DE CIêNCIAS E TECNOLOGIA, UNIVERSIDADE NOVA DE LISBOA, CAPARICA, PORTUGAL |
| |
| Abstract: | 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  be the smallest number ? such that any graph G of order n and any coloring of its edges with k colors, admits a monochromatic H‐decomposition with at most ? parts. Here, we study the function  for  and  . |
| |
| Keywords: | graph decompositions monochromatic graph decomposiitons |
|
|
