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édi \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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.