The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Bounds for the numner of matchings in regular graphs

Markstrom, K (Umea)
Tuesday 22 January 2008, 12:00-12:30

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.


[pdf ]




The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧