BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20230326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20221030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20220930T122641Z
UID:1667817000@ist.ac.at
DTSTART:20221107T113000
DTEND:20221107T123000
DESCRIPTION:Speaker: Benny Sudakov\nhosted by Matt Kwan\nAbstract: "Every l
arge system\, chaotic as it may be\, contains a well-organized subsystem".
This phenomenon is truly ubiquitous and manifests itself in different math
ematical areas. One of the central problems in extremal combinatorics\, w
hich was extensively studied in the last hundred years\, is to estimate h
ow large a graph/hypergraph needs to be to guarantee the emergence of suc
h well-organized substructures.In the first part of this talk we will give
an introduction to this topic\, mentioning some classical resultsas well
as a few applications to other areas of mathematics. Then we discuss the r
ecent solution(with Oliver Janzer) of the following fundamental problem\,
posed by Erdos and Sauer about 50 years ago:"How many edges on n vertices
force the existence of an r-regular subgraph (r>2)?"Our proof uses algebra
ic and probabilistic tools\, building on earlier works byAlon\, Friedland\
, Kalai\, Pyber\, Rödl and Szemerédi.
LOCATION:Raiffeisen Lecture Hall\, ISTA
ORGANIZER:arinya.eller@ist.ac.at
SUMMARY:Benny Sudakov: Emergence of regularity in large graphs
URL:https://talks-calendar.app.ist.ac.at/events/3825
END:VEVENT
END:VCALENDAR