Name
Abstract | ||
|---|---|---|
AbstractLet G be a graph whose edges are colored with k colors, and H=H1,ï ,Hk be a k-tuple of graphs. A monochromaticH-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 copy of Hi in color i, for some 1ï iï k. Let ï kn,H be the smallest number ï , such that, for every order-n graph and every k-edge-coloring, there is a monochromatic H-decomposition with at most ï elements. Extending the previous results of Liu and Sousa [Monochromatic Kr-decompositions of graphs, J Graph Theory 76 2014, 89-100], we solve this problem when each graph in H is a clique and nï n0H is sufficiently large. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1002/jgt.21851 | Periodicals |
Keywords | Field | DocType |
monochromatic graph decomposition,Turan number,Ramsey number | Discrete mathematics,Block graph,Combinatorics,Clique graph,Chordal graph,Simplex graph,Cograph,1-planar graph,Triangle-free graph,Mathematics,Split graph | Journal |
Volume | Issue | ISSN |
80 | 4 | 0364-9024 |
Citations | PageRank | References |
1 | 0.38 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henry Liu | 1 | 16 | 5.35 |
| Oleg Pikhurko | 2 | 318 | 47.03 |
| Teresa Sousa | 3 | 9 | 2.72 |