Minimum size extensible graphs for (near) perfect matchings
Résumé
We define as extensible a graph G such that for every pair u,v of non adjacent vertices it is possible to extend the non-edge uv to a perfect (or near perfect) matching using only edges of G that are not incident to u or v. For every order n of G we give Ext(n) the minimum size of an extensible graph.