Ruth Luo : Generalized Tur\'an problems for graphs and hypergraphs

Posted by Dhruv Mubayi , part of the Mathematical Computer Science Seminar.

At

Nov. 12, 2018, 3 p.m.

In

427 SEO

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.