Maximum matchings in a regular graph of specified connectivity and bounded order

Abstract

Abstract Upper bounds are placed on the order of a k ‐regular m ‐connected graph G that produce a lower bound on the number of independent edges in G . As a corollary, we obtain the order of a smallest k ‐regular m ‐connected graph which has no 1‐factor.