| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647491 | Discrete Mathematics | 2013 | 8 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Vitor Costa, Simone Dantas, Dieter Rautenbach,