On multipartite Hajnal-Szemerédi theorems

preprint2012arXivOpen access

Abstract

Let GG be a kk-partite graph with nn vertices in parts such that each vertex is adjacent to at least δ∗(G)δ^*(G) vertices in each of the other parts. Magyar and Martin \cite{MaMa} proved that for k=3k=3, if δ∗(G)≥2/3nδ^*(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édi \cite{MaSz} proved that GG contains a K4K_4-factor when δ∗(G)≥3/4nδ^*(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 k≥3k\ge 3.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.