Abstract
Given graphs G and H, an 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 graph isomorphic to H. Let ϕ H ( n ) be the smallest number ϕ such that any graph G of order n admits an H-decomposition with at most ϕ parts. Here we determine the asymptotic of ϕ H ( n ) for any fixed graph H as n tends to infinity. The exact computation of ϕ H ( n ) for an arbitrary H is still an open problem. Bollobás [B. Bollobás, On complete subgraphs of different orders, Math. Proc. Cambridge Philos. Soc. 79 (1976) 19–24] accomplished this task for cliques. When H is bipartite, we determine ϕ H ( n ) with a constant additive error and provide an algorithm returning the exact value with running time polynomial in log n .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
