Connectivity and separating sets of cages. - Tao Jiang 003; Dhruv Mubayi (J. Graph Theory, 1998)

Chromatic spectrum is broken. - Tao Jiang 003; Dhruv Mubayi; Zsolt Tuza; Vitaly I. Voloshin; Douglas B. West (Electron. Notes Discret. Math., 1999)

Coloring of trees with minimum sum of colors. - Tao Jiang 003; Douglas B. West (J. Graph Theory, 1999)

Edge-Bandwidth of Graphs. - Tao Jiang 003; Dhruv Mubayi; Aditya Shastri; Douglas B. West (SIAM J. Discret. Math., 1999)

New Upper Bounds for a Canonical Ramsey Problem. - Tao Jiang 003; Dhruv Mubayi (Comb., 2000)

Perfection thickness of graphs. - Hirotsugu Asari; Tao Jiang 003; André Kündgen; Douglas B. West (Discret. Math., 2000)

Correction to Edge-Bandwidth of Graphs. - Tao Jiang 003; Dhruv Mubayi; Aditya Shastri; Douglas B. West (SIAM J. Discret. Math., 2000)

Short Even Cycles In Cages With Odd Girth. - Tao Jiang 003 (Ars Comb., 2001)

On a Conjecture about Trees in Graphs with Large Girth. - Tao Jiang 003 (J. Comb. Theory B, 2001)

Small odd cycles in 4-chromatic graphs. - Tao Jiang 003 (J. Graph Theory, 2001)

Planar Hamiltonian chordal graphs are cycle extendable. - Tao Jiang 003 (Discret. Math., 2002)

Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees. - Tao Jiang 003; Douglas B. West (Electron. Notes Discret. Math., 2002)

Edge-Colorings with No Large Polychromatic Stars. - Tao Jiang 003 (Graphs Comb., 2002)

The Chromatic Spectrum of Mixed Hypergraphs. - Tao Jiang 003; Dhruv Mubayi; Zsolt Tuza; Vitaly I. Voloshin; Douglas B. West (Graphs Comb., 2002)

Anti-Ramsey Numbers of Subdivided Graphs. - Tao Jiang 003 (J. Comb. Theory B, 2002)

Local Anti-Ramsey Numbers of Graphs. - Maria Axenovich; Tao Jiang 003; Zsolt Tuza (Comb. Probab. Comput., 2003)

On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle. - Tao Jiang 003; Douglas B. West (Comb. Probab. Comput., 2003)

Vertex-disjoint cycles containing prescribed vertices. - Yoshiyasu Ishigami; Tao Jiang 003 (J. Graph Theory, 2003)

Constrained Ramsey numbers of graphs. - Robert E. Jamison; Tao Jiang 003; Alan C. H. Ling (J. Graph Theory, 2003)

Isometric cycles, cutsets, and crowning of bridged graphs. - Tao Jiang 003; Seog-Jin Kim; Douglas B. West (J. Graph Theory, 2003)

Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. - Noga Alon; Tao Jiang 003; Zevi Miller; Dan Pritikin (Random Struct. Algorithms, 2003)

Anti-Ramsey numbers for small complete bipartite graphs. - Maria Axenovich; Tao Jiang 003 (Ars Comb., 2004)

Bipartite anti-Ramsey numbers of cycles. - Maria Axenovich; Tao Jiang 003; André Kündgen (J. Graph Theory, 2004)

A note on a conjecture about cycles with many incident chords. - Tao Jiang 003 (J. Graph Theory, 2004)

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes. - Tao Jiang 003; Alexander Vardy (IEEE Trans. Inf. Theory, 2004)

On the Steiner, geodetic and hull numbers of graphs. - M. Carmen Hernando; Tao Jiang 003; Mercè Mora; Ignacio M. Pelayo; Carlos Seara (Discret. Math., 2005)

Edge-Bandwidth of the Triangular Grid. - Reza Akhtar; Tao Jiang 003; Dan Pritikin (Electron. J. Comb., 2007)

Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. - Reza Akhtar; Tao Jiang 003; Zevi Miller (SIAM J. Discret. Math., 2008)

Canonical Ramsey numbers and properly colored cycles. - Tao Jiang 003 (Discret. Math., 2009)

Anti-Ramsey numbers of doubly edge-critical graphs. - Tao Jiang 003; Oleg Pikhurko (J. Graph Theory, 2009)

Separation numbers of trees. - Tao Jiang 003; Zevi Miller; Dan Pritikin (Theor. Comput. Sci., 2009)

Set Systems without a Strong Simplex. - Tao Jiang 003; Oleg Pikhurko; Zelealem B. Yilma (SIAM J. Discret. Math., 2010)

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs. - Tao Jiang 003; Michael Salerno (Graphs Comb., 2011)

Compact topological minors in graphs. - Tao Jiang 003 (J. Graph Theory, 2011)

Near Optimal Bounds for Steiner Trees in the Hypercube. - Tao Jiang 003; Zevi Miller; Dan Pritikin (SIAM J. Comput., 2011)

Set Families With a Forbidden Induced Subposet. - Edward Boehnlein; Tao Jiang 003 (Comb. Probab. Comput., 2012)

Arrangements of k-sets with intersection constraints. - Tao Jiang 003; Manley Perkel; Dan Pritikin (Eur. J. Comb., 2012)

Turán Numbers of Subdivided Graphs. - Tao Jiang 003; Robert Seiver (SIAM J. Discret. Math., 2012)

Degree Ramsey numbers for cycles and blowups of trees. - Tao Jiang 003; Kevin G. Milans; Douglas B. West (Eur. J. Comb., 2013)

Exact solution of the hypergraph Turán problem for k-uniform linear paths. - Zoltán Füredi; Tao Jiang 003; Robert Seiver (Comb., 2014)

On the co-degree threshold for the Fano plane. - Louis DeBiasio; Tao Jiang 003 (Eur. J. Comb., 2014)

Hypergraph Turán numbers of linear cycles. - Zoltán Füredi; Tao Jiang 003 (J. Comb. Theory A, 2014)

On the bandwidth of the Kneser graph. - Tao Jiang 003; Zevi Miller; Derrek Yager (Discret. Appl. Math., 2017)

Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions. - Tao Jiang 003; Yuejian Peng; Biao Wu 001 (Eur. J. Comb., 2018)

Cycles of given lengths in hypergraphs. - Tao Jiang 003; Jie Ma 002 (J. Comb. Theory B, 2018)

Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (SIAM J. Discret. Math., 2019)

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (Discret. Appl. Math., 2020)

New bounds for a hypergraph bipartite Turán problem. - Beka Ergemlidze; Tao Jiang 003; Abhishek Methuku (J. Comb. Theory A, 2020)

Turán Numbers of Bipartite Subdivisions. - Tao Jiang 003; Yu Qiu (SIAM J. Discret. Math., 2020)

Partitioning ordered hypergraphs. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (J. Comb. Theory A, 2021)

On Turán exponents of bipartite graphs. - Tao Jiang 003; Jie Ma 002; Liana Yepremyan (Comb. Probab. Comput., 2022)

Bipartite-ness under smooth conditions. - Tao Jiang 003; Sean Longbrake; Jie Ma 002 (Comb. Probab. Comput., 2023)

Many Turán exponents via subdivisions. - Tao Jiang 003; Yu Qiu (Comb. Probab. Comput., 2023)

Rainbow Turán number of clique subdivisions. - Tao Jiang 003; Abhishek Methuku; Liana Yepremyan (Eur. J. Comb., 2023)

Tree-Degenerate Graphs and Nested Dependent Random Choice. - Tao Jiang 003; Sean Longbrake (SIAM J. Discret. Math., 2023)

Linear cycles of consecutive lengths. - Tao Jiang 003; Jie Ma 002; Liana Yepremyan (J. Comb. Theory B, 2023)

Extremal Problems for Hypergraph Blowups of Trees. - Zoltán Füredi; Tao Jiang 003; Alexandr V. Kostochka; Dhruv Mubayi; Jacques Verstraëte (SIAM J. Discret. Math., 2023)

Rainbow subdivisions of cliques. - Tao Jiang 003; Shoham Letzter; Abhishek Methuku; Liana Yepremyan (Random Struct. Algorithms, 2024)