2 citations · 2 across the 1 of their papers we have counts for
4 papers
Regularization and asymmetric extremal numbers of subdivisions
Tao Jiang, Sean Longbrake
Given a real , a graph is -almost-regular if . The celebrated regularization theorem of Erdős and Simonovits states that for every real $0<\varepsil…
Supersaturation via edge-gluing
Zihao Jin, Sean Longbrake, Liana Yepremyan
In 1984, Erdős and Simonovits conjectured the following: given a bipartite graph , there exist constants such that any graph on vertices and $pn^2\geq C \math…
Hamilton cycles in regular graphs perturbed by a random 2-factor
Cicely, Henderson, Sean Longbrake +2
In this paper, we prove that for each , the union of a -regular graph with a uniformly random -factor on the same vertex set is Hamiltonian with high probability. T…
Tree-degenerate graphs and nested dependent random choice
Tao Jiang, Sean Longbrake
The celebrated dependent random choice lemma states that in a bipartite graph an average vertex (weighted by its degree) has the property that almost all small subsets in its n…