Noga Alon, Ankur Moitra, Benny Sudakov
Nearly complete graphs decomposable into large induced matchings and their applications
STOC, 2012.
@inproceedings{STOC-2012-AlonMS, author = "Noga Alon and Ankur Moitra and Benny Sudakov", booktitle = "{Proceedings of the 44th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/2213977.2214074", isbn = "978-1-4503-1245-5", pages = "1079--1090", publisher = "{ACM}", title = "{Nearly complete graphs decomposable into large induced matchings and their applications}", year = 2012, }