BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20240331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260424T143301Z
UID:652e8139b4618394297287@ist.ac.at
DTSTART:20231108T130000
DTEND:20231108T141500
DESCRIPTION:Speaker: Yuval Wigderson\nhosted by Matthew Kwan\nAbstract: A b
 asic result of probabilistic combinatorics\, originally due to Erds and Rn
 yi\, is the determination of the threshold at which the random graph G_{n\
 ,p} contains a triangle with high probability. But one can also ask more r
 efined versions of this question\, where we ask not just for one triangle 
 but for many triangles which interact in complicated ways. For example\, w
 hat is the threshold at which we can no longer partition G_{n\,p} into two
  triangle-free subgraphs?Such questions are the subject of Ramsey properti
 es of random graphs\, and a very general conjecture of Kohayakawa and Kreu
 ter predicts an answer to all such questions. In this talk\, I will discus
 s the history of these problems\, and present recent progress which proves
  the KohayakawaKreuter conjecture in almost all cases.Joint work with Eden
  Kuperwasser and Wojciech Samotij.
LOCATION:Mondi Seminar Room 3\, Central Building\, ISTA
ORGANIZER:vkaluza@ist.ac.at
SUMMARY:Yuval Wigderson: Ramsey properties of random graphs
URL:https://talks-calendar.ista.ac.at/events/4519
END:VEVENT
END:VCALENDAR