Minimum Degree Threshold for $H$-factors with High Discrepancy

Domagoj Bradač, Micha Christoph, Lior Gishboliner

Given a graph $H$, a perfect $H$-factor in a graph $G$ is a collection of vertex-disjoint copies of $H$ spanning $G$. Kühn and Osthus showed that the minimum degree threshold for a…