9,914 research outputs found
Asymptotic multipartite version of the Alon-Yuster theorem
In this paper, we prove the asymptotic multipartite version of the
Alon-Yuster theorem, which is a generalization of the Hajnal-Szemer\'edi
theorem: If is an integer, is a -colorable graph and
is fixed, then, for every sufficiently large , where
divides , and for every balanced -partite graph on vertices with
each of its corresponding bipartite subgraphs having minimum
degree at least , has a subgraph consisting of
vertex-disjoint copies of .
The proof uses the Regularity method together with linear programming.Comment: 22 pages, 1 figur
- …