BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Statistical matching theory with a glimpse towards extremal regula
 r graphs - Peter Csikvari (Massachusetts Institute of Technology\; Eötvö
 s Loránd University)
DTSTART:20160711T093000Z
DTEND:20160711T101500Z
UID:TALK66698@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:In this talk we will survey some recent development on statist
 ical properties  of matchings of very large and infinite graphs. The main 
 goal of the talk is to  describe a few applications of a new concept calle
 d matching measure. These  applications include new results on the number 
 of (perfect) matchings in large  girth graphs as well as simple new proofs
  of certain statistical physical  theorems. In particular\, we will sketch
  a new proof of Schrijver&#39\;s lower bound  for the number of perfect ma
 tchings of regular bipartite graphs. We will also  mention some extremal g
 raph theoretic results about other graph parameters of  regular graphs. <b
 r> <span><br>This talk is based on joint papers with various subsets of Mi
 klos Abert\,  Peter E. Frenkel\, Tamas Hubai and Gabor Kun.</span>
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR