Nearly complete graphs decomposable into large induced matchings and their applications.

Noga Alon, Ankur Moitra, Benny Sudakov

Browse the full STOC paper archive.