T. Jiang

Publications92
h-index19
Citations1,170
Highly Influential Citations99
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • D. Mubayi
  • 207 Publications • 2,615 Citations
  • Z. Füredi
  • 264 Publications • 7,576 Citations
  • Jacques Verstraëte
  • 90 Publications • 1,467 Citations
  • P. Erdös
  • 964 Publications • 38,405 Citations
  • Publications
  • Influence
Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
TLDR
It is shown that for fixed m and d, and all sufficiently large n compared to m andd, f(m, G) = n for all graphs G with n vertices and maximum degree at most d.
View on Wiley
Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes
  • T. Jiang, A. Vardy
  • Computer Science
    IEEE Transactions on Information Theory
  • 18 April 2004
TLDR
It is shown that, in fact, there exists a positive constant c such that A/sub 2/(n, d)/spl ges/c2/sup n//V(n,d-1)log/ sub 2/V( n, d- 1) whenever d/n/spl les/0.499.
View on IEEE
Exact solution of the hypergraph Turán problem for k-uniform linear paths
TLDR
The intensive use of the delta-system method is used to determine exk(n, Pℓ(k) exactly for all fixed ℓ ≥1, k≥4, and sufficiently large n, and describe the unique extremal family.
View on Springer
Hypergraph Turán numbers of linear cycles
View PDF on arXiv
Edge-colorings of complete graphs that avoid polychromatic trees
View via Publisher
Constrained Ramsey numbers of graphs
TLDR
Using constructions from design theory, the exact values, lying near (s 1) (t 1), are established for f (S,T ) when S and T are certain paths or star-like trees.
View on Wiley
Turán Numbers of Subdivided Graphs
TLDR
It is proved that the Turan number ex(n,H^{(p)})=O(n^{1+(16/p)}, which is the maximum number of edges in an $n$-vertex simple graph that does not contain $F$ as a subgraph.
View via Publisher
Anti-Ramsey numbers for small complete bipartite graphs
On the Steiner, geodetic and hull numbers of graphs
View via Publisher
Edge-Colorings with No Large Polychromatic Stars
  • T. Jiang
  • Mathematics
    Graphs Comb.
  • 1 May 2002
TLDR
For all positive integers n and r, fr(Kn,n) exactly and fr( Kn) within 1 is determined, disproving a conjecture by Manoussakis, Spyratos, Tuza and Voigt about the largest number of colors that can be used in a coloring of E(G).
View on Springer
...
...