首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Monochromatic Kr‐Decompositions of Graphs
Authors:Henry Liu  Teresa Sousa
Institution: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 urn:x-wiley:03649024:media:jgt21750:jgt21750-math-0001 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 urn:x-wiley:03649024:media:jgt21750:jgt21750-math-0002 for urn:x-wiley:03649024:media:jgt21750:jgt21750-math-0003 and urn:x-wiley:03649024:media:jgt21750:jgt21750-math-0004.
Keywords:graph decompositions  monochromatic graph decomposiitons
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号