Noga Alon, Ankur Moitra, Benny Sudakov. Nearly complete graphs decomposable into large induced matchings and their applications. In Howard J. Karloff, Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012. pages 1079-1090, ACM, 2012. [doi]
Abstract is missing.