An asymptotic multipartite Kühn-Osthus theorem

Abstract

In this paper we prove an asymptotic multipartite version of a well-known theorem of Kühn and Osthus by establishing, for any graph $H$ with chromatic number $r$, the asymptotic multipartite minimum degree threshold which ensures that a large $r$-partite graph $G$ admits a perfect $H$-tiling. We also give the threshold for an $H$-tiling covering all but a linear number of vertices of $G$, in a multipartite analogue of results of Komlós and of Shokoufandeh and Zhao.

16 pages

References in corpus (2)

• Tripartite Version of the Corrádi-Hajnal Theorem
• Minimum degree thresholds for bipartite graph tiling

Cited by in corpus (2)

• Triangle-factors in pseudorandom graphs
• Powers of Hamiltonian cycles in multipartite graphs