Minimal H-factors and covers

Lorenzo Federico, Joel Larsson Danielsson

Given a fixed small graph H and a larger graph G, an H-factor is a collection of vertex-disjoint subgraphs $H^{\prime }\subset G$, each isomorphic to H, that cover the vertices of G. If G i…