BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/969
DTSTAMP:20230921T105045Z
SUMMARY:Trees that contain all small trees
DESCRIPTION:Speaker: Anamay Tengse\n\nAbstract: \nA tree is said to be n-un
 iversal if it "contains" all binary trees with at most n leaves. A result 
 of Chung\, Graham and Coppersmith from 1981 shows that when this containme
 nt is via sub-graphs\, an n-universal tree requires size n^Omega(log(n)). 
 Whereas when containment is defined via taking minors\, a construction by 
 Hrubes\, Wigderson and Yehudayoff from 2010 gives an n-universal tree of s
 ize O(n^4). In this talk\, we will look at both these results. If time per
 mits\, we will also discuss the context in which the latter group studied 
 universal trees.\n
URL:https://www.tcs.tifr.res.in/web/events/969
DTSTART;TZID=Asia/Kolkata:20190607T171500
DTEND;TZID=Asia/Kolkata:20190607T181500
LOCATION:A-201 Seminar Room
END:VEVENT
END:VCALENDAR