An asymptotic multipartite K\"uhn-Osthus theorem
Combinatorics
2017-07-17 v2
Abstract
In this paper we prove an asymptotic multipartite version of a well-known theorem of K\"uhn and Osthus by establishing, for any graph with chromatic number , the asymptotic multipartite minimum degree threshold which ensures that a large -partite graph admits a perfect -tiling. We also give the threshold for an -tiling covering all but a linear number of vertices of , in a multipartite analogue of results of Koml\'os and of Shokoufandeh and Zhao.
Cite
@article{arxiv.1604.03002,
title = {An asymptotic multipartite K\"uhn-Osthus theorem},
author = {Ryan R. Martin and Richard Mycroft and Jozef Skokan},
journal= {arXiv preprint arXiv:1604.03002},
year = {2017}
}
Comments
16 pages