BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Generalizing a conjecture of Aharoni\, Joos and Kim asked the 
 following intriguing question. Let H be a graph on m edges\, and let G_i (1
 &lt\;=i&lt\;=m) be a sequence of m graphs on the common vertex set [n]. Wha
 t is the weakest minimum degree restriction we can impose on each G_i to gu
 arantee a rainbow copy of H? Joos and Kim answered this question when H is 
 a Hamilton cycle or a perfect matching. We provide an asymptotic answer whe
 n H is an F-factor\, or a spanning tree with maximum degree o(n/log n). Thi
 s is joint work with Richard Montgomery and Yani Pehova. 
DTSTAMP:20201214T143200
DTSTART:20210104T150000
CLASS:PUBLIC
LOCATION:online\n 
SEQUENCE:0
SUMMARY:Alp Müyesser: Rainbow factors and trees
UID:113047028@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20210104-C-Muyesser.html
END:VEVENT
END:VCALENDAR