Mathematical Computer Science Seminar
Ruth Luo
UIUC
Generalized Tur\'an problems for graphs and hypergraphs
Abstract: We will talk about a generalization of the Tur\'an problem for hypergraphs: given a graph $F$, what is the maximum number of hyperedges an $r$-uniform $n$-vertex Berge $F$-free hypergraph can have? In particular, we will discuss tools used to reduce the hypergraph problem to problems for graphs. Finally, I will present some recent results for graphs without long Berge cycles. This is joint work with (different subsets of) Zoltan Furedi and Alexandr Kostochka.
Monday November 12, 2018 at 3:00 PM in 427 SEO