Tao Jiang

activity

20242026

most citedTree Posets: Supersaturation, Enumeration, and Randomness

2 citations · 3 across the 6 of their papers we have counts for

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

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 $r \in [1, 2]$ there exists a graph $H$ such that $ex (n, H) = Θ (n^{r})$ . We present a pr…

math.CO2026

Rational exponents near 3/2

Tao Jiang, Sean Longbrake, Liana Yepremyan

Given a graph $H$ , the extremal number $e x (n, H)$ is the maximum number of edges in an $n$ -vertex graph not containing $H$ as a subgraph. The well-known rational exponents conjectur…

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)…