𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximate multipartite version of the Hajnal–Szemerédi theorem

✍ Scribed by Béla Csaba; Marcelo Mydlarz


Book ID
113698916
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
242 KB
Volume
102
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


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