skip to content

Bounds for the numner of matchings in regular graphs

Tuesday 22nd January 2008 - 12:00 to 12:30
INI Seminar Room 1

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.

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.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons