BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Gabor Kun (Budapest)
DTSTART:20210604T130000Z
DTEND:20210604T140000Z
DTSTAMP:20260423T003235Z
UID:WCS/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/28/">Gra
 phings without measurable perfect matchings</a>\nby Gabor Kun (Budapest) a
 s part of Warwick Combinatorics Seminar\n\n\nAbstract\nMeasurable matching
 s of graphings (this is\, probability measure preserving Borel graphs) hav
 e attracted a great deal of attention in the last decades. The Banach-Tars
 ki paradox shows that the Hall condition does not guarantee the existence 
 of a measurable perfect matching in a bipartite graphing. Laczkovich gave 
 an example when the measurable Hall condition is not sufficient either. We
  discuss the few such counterexamples.\n
LOCATION:https://researchseminars.org/talk/WCS/28/
END:VEVENT
END:VCALENDAR