82 citations · 177 across the 29 of their papers we have counts for
4 papers · 1 filter
Hypergraphs not containing a tight tree with a bounded trunk
Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2
An -uniform hypergraph is a tight -tree if its edges can be ordered so that every edge contains a vertex that does not belong to any preceding edge and the set …
Tight paths in convex geometric hypergraphs
Zoltán Füredi, Tao Jiang, Alexandr Kostochka +2
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generali…
Lattice points in model domains of finite type in , II
Jingwei Guo, Tao Jiang
We study the lattice point problem associated with a special class of high-dimensional finite type domains via estimating the Fourier transforms of corresponding indicator function…
Supersaturation of Even Linear Cycles in Linear Hypergraphs
Tao Jiang, Liana Yepremyan
A classic result of Erdős and, independently, of Bondy and Simonovits says that the maximum number of edges in an -vertex graph not containing , the cycle of length …