On multipartite Hajnal-Szemer\'edi theorems
Combinatorics
2015-01-29 v2
Abstract
Let be a -partite graph with vertices in parts such that each vertex is adjacent to at least vertices in each of the other parts. Magyar and Martin \cite{MaMa} proved that for , if and is sufficiently large, then contains a -factor (a spanning subgraph consisting of vertex-disjoint copies of ) except that is one particular graph. Martin and Szemer\'edi \cite{MaSz} proved that contains a -factor when and is sufficiently large. Both results were proved by the Regularity Lemma. In this paper we give a proof of these two results by the absorbing method. Our absorbing lemma actually works for all .
Keywords
Cite
@article{arxiv.1203.2667,
title = {On multipartite Hajnal-Szemer\'edi theorems},
author = {Jie Han and Yi Zhao},
journal= {arXiv preprint arXiv:1203.2667},
year = {2015}
}
Comments
15 pages, no figure