BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ferenc Benc (Rényi Institute)
DTSTART:20201012T140000Z
DTEND:20201012T150000Z
DTSTAMP:20260423T035408Z
UID:EPC/29
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/29/">Ato
 ms of the matching measure</a>\nby Ferenc Benc (Rényi Institute) as part 
 of Extremal and probabilistic combinatorics webinar\n\n\nAbstract\nWe prov
 e that the matching measure of an infinite vertex-transitive connected gra
 ph has no atoms. Generalizing the results of Salez\, we show that for an e
 rgodic non-amenable unimodular random rooted graph with uniformly bounded 
 degrees\, the matching measure has only finitely many atoms. Ku and Chen p
 roved the analogue of the Gallai-Edmonds structure theorem for non-zero ro
 ots of the matching polynomial for finite graphs. We extend their results 
 for infinite graphs. We also show that the corresponding Gallai-Edmonds de
 composition is compatible with the zero temperature monomer-dimer model. J
 oint work with András Mészáros.\n
LOCATION:https://researchseminars.org/talk/EPC/29/
END:VEVENT
END:VCALENDAR