Variants of the Hajnal-Szemer�di Theorem
✍
Fischer, Eldar
📂
Article
📅
1999
🏛
John Wiley and Sons
🌐
English
⚖ 245 KB
The Hajnal-Szemerédi Theorem [Hajnal & Szemerédi, Colloq Math Soc J Bolyai, 1970] states that a graph with hk vertices and minimum degree at least (h -1)k contains k vertex disjoint copies of K h . Its proof is not algorithmic. Here, we present an algorithm that, for a fixed h, finds in such a graph