Abstract
An H -packing of G is a collection of vertex-disjoint subgraphs of G such that each component is isomorphic to H . An H -packing of G is maximal if it cannot be extended to a larger H -packing of G . In this paper we consider problem of random allocation of a sequential resource into blocks of m consecutive units and show how it can be successfully modeled in terms of maximal P m -packings. We enumerate maximal P m -packings of P n of a given cardinality and determine the asymptotic behavior of the enumerating sequences. We also compute the expected size of m -packings and provide a lower bound on the efficiency of block-allocation.
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.
