Discrete Math Seminar Fall 2008
Entropy methods for estimating the number of perfect matchings in graphs
Jamie Radcliffe, UNL; Nov 4
Recently a number of people have used entropy methods to solve
previously intractable problems concerned with estimating graph
parameters. I will give a brief introduction to entropy and give
Radakrishnan's entropy proof of Bregman's theorem. If there is time I will
give a new proof of an extension of Bregman's theorem.