Nearly complete graphs decomposable into large induced matchings and their applications

Noga Alon, Ankur Moitra, Benny Sudakov

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Fingerprint

Dive into the research topics of 'Nearly complete graphs decomposable into large induced matchings and their applications'. Together they form a unique fingerprint.

Mathematics

Keyphrases