19 citations · 65 across the 11 of their papers we have counts for
4 papers · 2 filters
Mantel's Theorem for Random Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +1
A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of is bipartite. A sparse version of Mantel's Theorem…
Eigenvalues of Non-Regular Linear-Quasirandom Hypergraphs
John Lenz, Dhruv Mubayi
Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended thi…
Hypergraphs with Zero Chromatic Threshold
József Balogh, John Lenz
Let F be an r-uniform hypergraph. The chromatic threshold of the family of F-free, r-uniform hypergraphs is the infimum of all non-negative reals c such that the subfamily of F-fre…
Spectral extremal problems for hypergraphs
Peter Keevash, John Lenz, Dhruv Mubayi
In this paper we consider spectral extremal problems for hypergraphs. We give two general criteria under which such results may be deduced from `strong stability' forms of the corr…