T. Jiang

activity

19992022

most citedAsymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes

82 citations · 177 across the 29 of their papers we have counts for

collaborators

32 papers

math.CO2022★ 2 cited

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 $S$ in its n…

math.CO2021

Bipartite-ness under smooth conditions

Tao Jiang, Sean Longbrake, Jie Ma

Given a family $F$ of bipartite graphs, the {\it Zarankiewicz number} $z (m, n, F)$ is the maximum number of edges in an $m$ by $n$ bipartite graph $G$ that does n…

math.CO2021

Rainbow subdivisions of cliques

Tao Jiang, Shoham Letzter, Abhishek Methuku +1

We show that for every integer $m \geq 2$ and large $n$ , every properly edge-coloured graph on $n$ vertices with at least $n (lo g n)^{53}$ edges contains a rainbow subdivision of $…

math.CO2021★ 10 cited

Rainbow Turán number of clique subdivisions

Tao Jiang, Abhishek Methuku, Liana Yepremyan

We show that for any integer $t \geq 2$ , every properly edge-coloured graph on $n$ vertices with more than $n^{1 + o (1)}$ edges contains a rainbow subdivision of $K_{t}$ . Note that this…

math.NT2020

Variance of lattice point counting in some special shells in $R^{d}$

Tao Jiang

We study the variance of the random variable that counts the number of lattice points in some shells generated by a special class of finite type domains in $R^{d}$ . The proof…

math.CO2020★ 2 cited

Negligible obstructions and Turán exponents

Tao Jiang, Zilin Jiang, Jie Ma

We show that for every rational number $r \in (1, 2)$ of the form $2 - a / b$ , where $a, b \in N^{+}$ satisfy $⌊ b / a ⌋^{3} \leq a \leq b / (⌊ b / a ⌋ + 1) + 1$ …