2 citations · 3 across the 6 of their papers we have counts for
7 papers · 1 filter
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang +5
The rational exponents conjecture of Erdős and Simonovits asserts that for every rational there exists a graph such that . We present a pr…
Rational exponents near 3/2
Tao Jiang, Sean Longbrake, Liana Yepremyan
Given a graph , the extremal number is the maximum number of edges in an -vertex graph not containing as a subgraph. The well-known rational exponents conjectur…
Induced rational exponents near two
Tao Jiang, Sean Longbrake
Given a bipartite graph and a natural number , let denote the maximum number of edges in an -vertex graph that contains neither nor an in…
On the number of families avoiding a subposet
Tao Jiang, Sean Longbrake, Liana Yepremyan
In this paper we show that for any poset that is not an antichain, the number of induced -free families in the Boolean lattice is at most $ 2^{O(\mathrm{La}^*(n,P)…
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…
On the number of H-free hypergraphs
Tao Jiang, Sean Longbrake
Two central problems in extremal combinatorics are concerned with estimating the number , the size of the largest -free hypergraph on vertices, and the number $forb…
Tree Posets: Supersaturation, Enumeration, and Randomness
Tao Jiang, Sean Longbrake, Sam Spiro +1
We develop a powerful tool for embedding any tree poset of height in the Boolean lattice which allows us to solve several open problems in the area. We show that: * If …