On multipartite Hajnal-Szemer\'edi theorems
Abstract
Let G be a k-partite graph with n vertices in parts such that each vertex is adjacent to at least δ*(G) vertices in each of the other parts. Magyar and Martin MaMa proved that for k=3, if δ*(G) 2/3n and n is sufficiently large, then G contains a K3-factor (a spanning subgraph consisting of n vertex-disjoint copies of K3) except that G is one particular graph. Martin and Szemer\'edi MaSz proved that G contains a K4-factor when δ*(G) 3/4n and n 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 3.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.