Discrete Math Seminar: Sufficient Conditions for Perfect Mixed Tilings

We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs $H$ with components of sublinear order. As a corollary, we recover and extend the work of Kühn and Osthus regarding sufficient minimum degree conditions for perfect $F$-tilings (for an arbitrary fixed graph $F$) by replacing the $F$-tiling with the aforementioned graphs $H$. Moreover, we obtain analogous results for degree sequences. Finally, we asymptotically resolve a conjecture of Komlós in a strong sense.

The paper was joint work with Felix Joos and Richard Lang, and can be found here https://arxiv.org/abs/2201.03944