An asymptotic multipartite Kühn-Osthus theorem
Research output: Contribution to journal › Article › peer-review
Colleges, School and Institutes
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.
|Number of pages||16|
|Journal||SIAM Journal on Discrete Mathematics|
|Publication status||Published - 13 Jul 2017|
- tiling , Hajnal-Szemer´edi , K¨uhn-Osthus , multipartite , regularity , linear programming