Matchings in graphs of odd regularity and girth

We establish lower bounds on the matching number of graphs of given odd regularity dd and odd girth gg, which are sharp for many values of dd and gg. For d=g=5d=g=5, we characterize all extremal graphs.