BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//EventXplore//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:07bdf742-cebc-42b5-8098-3735b18f981b@eventxplore
DTSTAMP:20260928T205943Z
DTSTART:20261005T190000Z
DTEND:20261104T221500Z
SUMMARY:Richard P. Stanley Seminar in Combinatorics
DESCRIPTION:Speaker: Xiaoyu He (Georgia Tech) Title: Off-diagonal hypergraph Ramsey numbers Abstract: Let $r(H\,n)$ denote the minimum $N$ such that any $3$-uniform hypergraph on $N$ vertices contains either a copy of $H$ or an independent set of size $n$. A tantalizing conjecture in the area states that $r(H\,n)$ is polynomial in $n$ if and only if $H$ lies in the iterated blowup of a single edge. We present recent progress towards this conjecture\, including a proof of the conjecture when $H$ has at most $5$ tightly connected components. Joint work with David Conlon\, Jiaxi Nie\, and Logan Post.
LOCATION:Building 2
END:VEVENT
END:VCALENDAR