Combinatorics Seminar
Dhruv Mubayi
UIC
Eigenvalues and Packing problems in hypergraphs I
Abstract: Since the foundational results of Thomason and Chung-Graham-Wilson on
quasirandom graphs over 20 years ago, there has been a lot of
effort by many researchers to extend the theory to hypergraphs. I will
present some of this history, and then describe our recent results that provide
such a generalization in some cases. One key new aspect in the theory is
a systematic study of hypergraph eigenvalues first introduced by Friedman
and Wigderson. This leads to the study of various extremal questions on
hypergraphs, for example, spectral Turan problems and spectral packing
problems. This is joint work with Peter Keevash and John Lenz.
Monday October 6, 2014 at 3:00 PM in SEO 427