BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d0d13d9d90e
DTSTART;TZID=America/Toronto:20230724T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230724T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-seminar-tom-kelly
SUMMARY:Graphs and Matroids Seminar - Tom Kelly
CLASS:PUBLIC
DESCRIPTION:TITLE: Robustness for hypergraph embeddings via spreadness\n\nS
 PEAKER:\n Tom Kelly\n\nAFFILIATION:\n Georgia Tech\n\nLOCATION:\n MC 5479\
 n\nABSTRACT: In joint work with Kang\, K\\\"uhn\, Methuku\, and Osthus\, w
 e\nproved the following: If $p\\geq{C\\log^2n/n}$ and $L_{i\,j}\\subseteq[
 n]$\nis a random subset of $[n]$ where each $k\\in[n]$ is included in\n$L_
 {i\,j}$ independently with probability $p$ for each $i\,j\\in[n]$\,\nthen 
 asymptotically almost surely there is an order-$n$ Latin square\nin which 
 the entry in the $i$th row and $j$th column lies in\n$L_{i\,j}$.  We prov
 e analogous results for Steiner triple systems and\n$1$-factorizations of 
 complete graphs.  These results can be\nunderstood as stating that these 
 ``design-like'' structures exist\n``robustly''.
DTSTAMP:20260404T085213Z
END:VEVENT
END:VCALENDAR