Binding number conditions for matching extension Original Research Article

A graph is k-extendable if it has a matching of k edges and every such matching can be extended to a 1-factor. We find a sharp lower bound on the binding number, in terms of n and k, which suffices to ensure that a graph of order n is k-extendable.