Tao Jiang

activity

20242026

collaborators

4 papers

math.CO2026

Induced rational exponents near two

Tao Jiang, Sean Longbrake

Given a bipartite graph $H$ and a natural number $s$ , let $ex^{*} (n, H, s)$ denote the maximum number of edges in an $n$ -vertex graph that contains neither $K_{s, s}$ nor an in…

math.CO2026

On the number of families avoiding a subposet

Tao Jiang, Sean Longbrake, Liana Yepremyan

In this paper we show that for any poset $P$ that is not an antichain, the number of induced $P$ -free families in the Boolean lattice $2^{[n]}$ is at most $ 2^{O(\mathrm{La}^*(n,P)…

math.CO2025

Regularization and asymmetric extremal numbers of subdivisions

Tao Jiang, Sean Longbrake

Given a real $μ \geq 1$ , a graph $H$ is $μ$ -almost-regular if $Δ (H) \leq μ δ (H)$ . The celebrated regularization theorem of Erdős and Simonovits states that for every real $0<\varepsil…

math.CO2024

On the number of H-free hypergraphs

Tao Jiang, Sean Longbrake

Two central problems in extremal combinatorics are concerned with estimating the number $e x (n, H)$ , the size of the largest $H$ -free hypergraph on $n$ vertices, and the number $forb…