Let H be a tree on h greater than or equal to 2 vertices, It is shown that if it is sufficiently large and G =( V, E) is an n-vertex graph with delta(G) greater than or equal to[n/2] then there are [ E /(h-1)] edge-disjoint subgraphs of G which are isomorphic to H. In particular. if h - 1 divides E then there is an H-decomposition of G. This result is best possible as there are infinitely many examples of trees on h vertices and graphs G with m(h - 1) edges, delta(G) greater than or equal to [n/2] - 1 for which G has no H-decomposition. (C) 2000 Academic Press. [References: 11]
展开▼
机译：设H是h上大于或等于2个顶点的树，表明如果它足够大并且G =（V，E）是delta（G）大于或等于[n / 2]，则G的[ E /（h-1）]边不相交的子图与H同构。特别是。如果h-1除以 E ，则存在G的H分解。最好的结果是，因为在h个顶点上有无数的树实例，并且图m具有m（h-1）边，即delta（G）大于或等于[n / 2]-1，其中G没有H分解。 （C）2000学术出版社。 [参考：11]
展开▼
