BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Statistical matching theory with a glimpse towards
extremal regular graphs - Peter Csikvari (Massach
usetts Institute of Technology\; Eötvös Loránd Uni
versity)
DTSTART;TZID=Europe/London:20160711T103000
DTEND;TZID=Europe/London:20160711T111500
UID:TALK66698AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/66698
DESCRIPTION:In this talk we will survey some recent developmen
t on statistical properties of matchings of very
large and infinite graphs. The main goal of the ta
lk is to describe a few applications of a new con
cept called matching measure. These applications
include new results on the number of (perfect) mat
chings in large girth graphs as well as simple ne
w proofs of certain statistical physical theorems
. In particular\, we will sketch a new proof of Sc
hrijver'\;s lower bound for the number of perf
ect matchings of regular bipartite graphs. We will
also mention some extremal graph theoretic resul
ts about other graph parameters of regular graphs
.

This talk is based on joint paper
s with various subsets of Miklos Abert\, Peter E.
Frenkel\, Tamas Hubai and Gabor Kun.
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:INI IT
END:VEVENT
END:VCALENDAR