scientific article; zbMATH DE number 398941

From MaRDI portal
Publication:4201555





[For Part I, Part II and Part III see Zbl 0608.05028, Zbl 0578.05013 and Zbl 0699.05044, respectively.] The investigation of the packing number \(P(n,H)\), i.e. the maximal number of pairwise edge disjoint subgraphs of \(K_ n\) isomorphic to \(H\), and of the covering number \(C(n,H)\), i.e. the minimum number of subgraphs of \(K_ n\) isomorphic to \(H\) and covering \(K_ n\), is continued. For \(H\) being any tree of order seven and \(n \geq 11\) it is shown that \(P(n,H) = \lfloor {n(n-1) \over 12} \rfloor\) and \(C(n,H) = \lceil {n(n-1) \over 12} \rceil\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4201555)