1 citations · 1 across the 1 of their papers we have counts for
1 paper
Daniela Kühn, Deryk Osthus, Andrew Treglown
We say that a graph G has a perfect H-packing (also called an H-factor) if there exists a set of disjoint copies of H in G which together cover all the vertices of G. Given a graph…