BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//7.4.2//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:373@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20250122T143000

DTEND;TZID=Asia/Jerusalem:20250122T152000

DTSTAMP:20250109T092954Z

URL:https://math.technion.ac.il/events/asaf-cohen-antonir/

SUMMARY:Asaf Cohen Antonir (Tel Aviv) — Weak saturation and collapsible c
 omplexes in a random graph
DESCRIPTION:Lecturer:Asaf Cohen Antonir\n Location:814 Amado\n Let H\, G be
  two graphs. A spanning subgraph G’ of G is called weakly H-saturated if
  the following holds: one can add to G' the edges of G \\ G’ in some ord
 er so that whenever a new edge is added\, a new copy of H is formed. Obtai
 ning lower bounds for the size of such a G’ (for various H and G) is a c
 lassical problem in extremal combinatorics. In particular\, in the past 40
  years\, various algebraic tools have been used in order to prove such low
 er bounds.\n\n\n\nOur first contribution in this work unravels a new algeb
 raic/topological connection which can be used in order to prove the follow
 ing result. Let w-sat(t\,G) be the size of a smallest weakly K_t-saturatin
 g subgraph of G. Korándi and Sudakov asked to determine the threshold pro
 bability for the property that w-sat(t\,G(n\,p))=w-sat(t\,K_n). Using our 
 new observation\, in the case t=3\, we show that the threshold probability
  is located at p=n^{-1/3 +/- o(1)}. Moreover\, using an argument inspired 
 by Gromov's `local to global' theorem\, we determine\, up to a multiplicat
 ive constant factor\, the threshold probability for a bounded diameter ver
 sion of the theorem.\n\n\n\nInterestingly\, our new connection between wea
 k saturation and topological properties goes both ways since it also enabl
 es us to use combinatorial arguments in order to obtain new results concer
 ning topological properties of random clique complexes.\nIn particular\, w
 e obtain a new upper bound on the threshold probability for simple connect
 ivity of the 2-dimensional clique complex of G(n\,p)\, improving a result 
 of Kahle.\n\n\n\nJoint work with Yuval Peled\, Asaf Shapira\, Mykhaylo Tyo
 mkyn\, and Maksim Zhukovskii.\n\n&nbsp\;\n 
CATEGORIES:Combinatorics Seminar,Seminars
LOCATION:814 Amado

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:STANDARD

DTSTART:20241027T010000

TZOFFSETFROM:+0300

TZOFFSETTO:+0200

TZNAME:IST

END:STANDARD

END:VTIMEZONE
END:VCALENDAR