9 citations · 12 across the 5 of their papers we have counts for
14 papers
Hamilton cycles in quasirandom hypergraphs
John Lenz, Dhruv Mubayi, Richard Mycroft
We show that, for a natural notion of quasirandomness in -uniform hypergraphs, any quasirandom -uniform hypergraph on vertices with constant edge density and minimum vert…
Perfect Packings in Quasirandom Hypergraphs II
John Lenz, Dhruv Mubayi
For each of the notions of hypergraph quasirandomness that have been studied, we identify a large class of hypergraphs F so that every quasirandom hypergraph H admits a perfect F-p…
Perfect Packings in Quasirandom Hypergraphs
John Lenz, Dhruv Mubayi
Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with…
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…