High-dimensional Hoffman bound and extremal combinatorics

Yuval Filmus, Konstantin Golubev and Noam Lifshitz

We generalize the Hoffman bound to simplicial complexes. We demonstrate our result by giving spectral proofs for Mantel’s theorem and for an optimal bound on $s$-wise intersecting families due to Frankl and Tokushige. As a new application, we give tight bounds on a question of Frankl about hypergraphs without extended triangles.


 author = {Yuval Filmus and Konstantin Golubev and Noam Lifshitz},
 title = {High dimensional Hoffman bound and applications in extremal combinatorics},
 year = {2019}
copy to clipboard