19 citations · 65 across the 11 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…
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…
The Poset of Hypergraph Quasirandomness
John Lenz, Dhruv Mubayi
Chung and Graham began the systematic study of k-uniform hypergraph quasirandom properties soon after the foundational results of Thomason and Chung-Graham-Wilson on quasirandom gr…
Eigenvalues and Linear Quasirandom Hypergraphs
John Lenz, Dhruv Mubayi
Let p(k) denote the partition function of k. For each k >= 2, we describe a list of p(k)-1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous n…
Multicolor Ramsey Numbers for Complete Bipartite Versus Complete Graphs
John Lenz, Dhruv Mubayi
Let H_1, ..., H_k be graphs. The multicolor Ramsey number r(H_1,...,H_k) is the minimum integer r such that in every edge-coloring of K_r by k colors, there is a monochromatic copy…
On the Ramsey-Turán numbers of graphs and hypergraphs
József Balogh, John Lenz
Let t be an integer, f(n) a function, and H a graph. Define the t-Ramsey-Turán number of H, RT_t(n, H, f(n)), to be the maximum number of edges in an n-vertex, H-free graph G where…
Some Exact Ramsey-Turán Numbers
József Balogh, John Lenz
Let r be an integer, f(n) a function, and H a graph. Introduced by Erdős, Hajnal, Sós, and Szemerédi, the r-Ramsey-Turán number of H, RT_r(n, H, f(n)), is defined to be the maximum…
On the Chromatic Thresholds of Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +2
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minim…
Complete Minors, Independent Sets, and Chordal Graphs
Jozsef Balogh, John Lenz, Hehui Wu
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conjecture states that h(G) >= χ(G). Since χ(G) α(G) >= |V(G)|, Hadwiger's Conjecture…