Bounds for the numner of matchings in regular graphs
Seminar Room 1, Newton Institute
In this talk I will first present a group of conjectures on the number of k-edge matchings in a regular graph on n vertices. Next I will present the partial results obtained so far. In order to get lower bounds for the number of matchings for all densities k/n we make use of the fact that the matching polynomial of a graph has real zeros.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.