English

On multipartite Hajnal-Szemer\'edi theorems

Combinatorics 2015-01-29 v2

Abstract

Let GG be a kk-partite graph with nn vertices in parts such that each vertex is adjacent to at least δ(G)\delta^*(G) vertices in each of the other parts. Magyar and Martin \cite{MaMa} proved that for k=3k=3, if δ(G)2/3n\delta^*(G)\ge 2/3n and nn is sufficiently large, then GG contains a K3K_3-factor (a spanning subgraph consisting of nn vertex-disjoint copies of K3K_3) except that GG is one particular graph. Martin and Szemer\'edi \cite{MaSz} proved that GG contains a K4K_4-factor when δ(G)3/4n\delta^*(G)\ge 3/4n and nn 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 k3k\ge 3.

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

R2 v1 2026-06-21T20:33:00.107Z