Completing Partial Packings of Bipartite Graphs

Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn

Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-de…