High girth and extendability Original Research Article

In this paper, we present a construction of graphs Gk,n which have girth at least n and for which every matching of size k may be extended to a perfect matching of Gk,n. This also yields a new construction of graphs with a given edge-density and girth.