default search action
"Nearly Complete Graphs Decomposable into Large Induced Matchings and their ..."
Noga Alon, Ankur Moitra, Benny Sudakov (2011)
- Noga Alon, Ankur Moitra, Benny Sudakov:
Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications. CoRR abs/1111.0253 (2011)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.