Matchings in graphs of odd regularity and girth

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