An asymptotic multipartite Kühn-Osthus theorem
Martin, R. R., Mycroft, R. & Skokan, J.
(2017).
An asymptotic multipartite Kühn-Osthus theorem.
SIAM Journal on Discrete Mathematics,
31(3), 1498-1513.
https://doi.org/10.1137/16M1070621
(2017).
An asymptotic multipartite Kühn-Osthus theorem.
SIAM Journal on Discrete Mathematics,
31(3), 1498-1513.
https://doi.org/10.1137/16M1070621
In this paper we prove an asymptotic multipartite version of a well-known theorem of K¨uhn 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´os and of Shokoufandeh and Zhao.
-
picture_as_pdf - Skoksan_An asymptotic multipartite theorem.pdf
-
subject - Published Version
-
picture_as_pdf - SCR_Status_2010.pdf
-
subject - Accepted Version