BEGIN:VCALENDAR
VERSION:2.0
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
BEGIN:VEVENT
CATEGORIES:Conferences/Seminars/Lectures
DESCRIPTION:Speaker: Tom Kelly (Georgia Tech)\n\nTitle: Hypergraph embeddi
ngs and decompositions: robustness via spreadness\n\nAbstract: A graph H
embeds in a graph G if G contains a subgraph isomorphic to H\, and it deco
mposes G if the edges of G can be partitioned into subgraphs isomorphic to
H. Questions about when a graph embeds in or decomposes another are central
in combinatorics. ``Dirac-type'' embedding results address minimum-degree
conditions to ensure an embedding of some graph. Block designs\, a fundamen
tal object of Design Theory\, are decompositions of complete graphs.\n\nIn
this talk\, we will discuss robustness of embeddings and decompositions. Fo
r example\, given a hypergraph of large minimum degree\, we will discuss th
e threshold for a random subhypergraph to have a perfect matching or Hamilt
on cycle. We will also discuss the threshold for constructing block designs
using only a random selection of blocks. All of these results utilize the
recent Park--Pham Theorem or one of its variants. A crucial notion for this
is that of the spreadness of a certain type of probability distribution.
DTEND:20240315T200000Z
DTSTAMP:20241109T094214Z
DTSTART:20240315T190000Z
GEO:42.358262;-71.090045
LOCATION:Building 2\, Room 139
SEQUENCE:0
SUMMARY:Richard P. Stanley Seminar in Combinatorics: Tom Kelly (Georgia Te
ch)
UID:tag:localist.com\,2008:EventInstance_45704467165678
URL:https://calendar.mit.edu/event/richard_p_stanley_seminar_in_combinatori
cs_daniel_altman_university_of_michigan
END:VEVENT
END:VCALENDAR