Tao Jiang

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 12

Top Topics

Classification Trees

Bipartite Graph

Computationally Challenging

Top Venues

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Discret. Appl. Math.

SIAM J. Discret. Math.

Publications

Tao Jiang, Shoham Letzter, Abhishek Methuku, Liana Yepremyan
Rainbow subdivisions of cliques. Random Struct. Algorithms 64 (3) (2024)
Tao Jiang, Abhishek Methuku, Liana Yepremyan
Rainbow Turán number of clique subdivisions. Eur. J. Comb. 110 (2023)
Tao Jiang, Sean Longbrake, Jie Ma
Bipartite-ness under smooth conditions. Comb. Probab. Comput. 32 (4) (2023)
Tao Jiang, Jie Ma, Liana Yepremyan
Linear cycles of consecutive lengths. J. Comb. Theory, Ser. B 163 (2023)
Tao Jiang, Yu Qiu
Many Turán exponents via subdivisions. Comb. Probab. Comput. 32 (1) (2023)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Extremal Problems for Hypergraph Blowups of Trees. SIAM J. Discret. Math. 37 (4) (2023)
Tao Jiang, Jie Ma, Liana Yepremyan
On Turán exponents of bipartite graphs. Comb. Probab. Comput. 31 (2) (2022)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Partitioning ordered hypergraphs. J. Comb. Theory, Ser. A 177 (2021)
Beka Ergemlidze, Tao Jiang, Abhishek Methuku
New bounds for a hypergraph bipartite Turán problem. J. Comb. Theory, Ser. A 176 (2020)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. Discret. Appl. Math. 276 (2020)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM J. Discret. Math. 33 (2) (2019)
Tao Jiang, Zevi Miller, Derrek Yager
On the bandwidth of the Kneser graph. Discret. Appl. Math. 227 (2017)
Zoltán Füredi, Tao Jiang
Hypergraph Turán numbers of linear cycles. J. Comb. Theory, Ser. A 123 (1) (2014)
Zoltán Füredi, Tao Jiang, Robert Seiver
Exact solution of the hypergraph Turán problem for k-uniform linear paths. Comb. 34 (3) (2014)
Louis DeBiasio, Tao Jiang
On the co-degree threshold for the Fano plane. Eur. J. Comb. 36 (2014)
Tao Jiang, Kevin G. Milans, Douglas B. West
Degree Ramsey numbers for cycles and blowups of trees. Eur. J. Comb. 34 (2) (2013)
Edward Boehnlein, Tao Jiang
Set Families With a Forbidden Induced Subposet. Comb. Probab. Comput. 21 (4) (2012)
Tao Jiang, Robert Seiver
Turán Numbers of Subdivided Graphs. SIAM J. Discret. Math. 26 (3) (2012)
Tao Jiang, Manley Perkel, Dan Pritikin
Arrangements of k-sets with intersection constraints. Eur. J. Comb. 33 (8) (2012)
Tao Jiang
Compact topological minors in graphs. J. Graph Theory 67 (2) (2011)
Tao Jiang, Michael Salerno
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs. Graphs Comb. 27 (1) (2011)
Tao Jiang, Zevi Miller, Dan Pritikin
Near Optimal Bounds for Steiner Trees in the Hypercube. SIAM J. Comput. 40 (5) (2011)
Tao Jiang, Oleg Pikhurko, Zelealem B. Yilma
Set Systems without a Strong Simplex. SIAM J. Discret. Math. 24 (3) (2010)
Tao Jiang
Canonical Ramsey numbers and properly colored cycles. Discret. Math. 309 (13) (2009)
Tao Jiang, Oleg Pikhurko
Anti-Ramsey numbers of doubly edge-critical graphs. J. Graph Theory 61 (3) (2009)
Tao Jiang, Zevi Miller, Dan Pritikin
Separation numbers of trees. Theor. Comput. Sci. 410 (38-40) (2009)
Reza Akhtar, Tao Jiang, Zevi Miller
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. SIAM J. Discret. Math. 22 (2) (2008)
Reza Akhtar, Tao Jiang, Dan Pritikin
Edge-Bandwidth of the Triangular Grid. Electron. J. Comb. 14 (1) (2007)
M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara
On the Steiner, geodetic and hull numbers of graphs. Discret. Math. 293 (1-3) (2005)
Tao Jiang
A note on a conjecture about cycles with many incident chords. J. Graph Theory 46 (3) (2004)
Tao Jiang, Douglas B. West
Edge-colorings of complete graphs that avoid polychromatic trees. Discret. Math. 274 (1-3) (2004)
Maria Axenovich, Tao Jiang
Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb. 73 (2004)
Tao Jiang, Alexander Vardy
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes. IEEE Trans. Inf. Theory 50 (8) (2004)
Maria Axenovich, Tao Jiang, André Kündgen
Bipartite anti-Ramsey numbers of cycles. J. Graph Theory 47 (1) (2004)
Tao Jiang, Douglas B. West
On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle. Comb. Probab. Comput. 12 (5-6) (2003)
Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Struct. Algorithms 23 (4) (2003)
Tao Jiang, Seog-Jin Kim, Douglas B. West
Isometric cycles, cutsets, and crowning of bridged graphs. J. Graph Theory 43 (3) (2003)
Maria Axenovich, Tao Jiang, Zsolt Tuza
Local Anti-Ramsey Numbers of Graphs. Comb. Probab. Comput. 12 (5-6) (2003)
Robert E. Jamison, Tao Jiang, Alan C. H. Ling
Constrained Ramsey numbers of graphs. J. Graph Theory 42 (1) (2003)
Yoshiyasu Ishigami, Tao Jiang
Vertex-disjoint cycles containing prescribed vertices. J. Graph Theory 42 (4) (2003)
Tao Jiang
Edge-Colorings with No Large Polychromatic Stars. Graphs Comb. 18 (2) (2002)
Tao Jiang
Anti-Ramsey Numbers of Subdivided Graphs. J. Comb. Theory, Ser. B 85 (2) (2002)
Tao Jiang, Douglas B. West
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees. Electron. Notes Discret. Math. 11 (2002)
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
The Chromatic Spectrum of Mixed Hypergraphs. Graphs Comb. 18 (2) (2002)
Tao Jiang
Planar Hamiltonian chordal graphs are cycle extendable. Discret. Math. 257 (2-3) (2002)
Tao Jiang
Small odd cycles in 4-chromatic graphs. J. Graph Theory 37 (2) (2001)
Tao Jiang
On a Conjecture about Trees in Graphs with Large Girth. J. Comb. Theory, Ser. B 83 (2) (2001)
Tao Jiang
Short Even Cycles In Cages With Odd Girth. Ars Comb. 59 (2001)
Tao Jiang, Dhruv Mubayi
New Upper Bounds for a Canonical Ramsey Problem. Comb. 20 (1) (2000)
Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West
Correction to Edge-Bandwidth of Graphs. SIAM J. Discret. Math. 13 (1) (2000)
Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West
Perfection thickness of graphs. Discret. Math. 215 (2000)
Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West
Chromatic spectrum is broken. Electron. Notes Discret. Math. 3 (1999)
Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West
Edge-Bandwidth of Graphs. SIAM J. Discret. Math. 12 (3) (1999)
Tao Jiang, Douglas B. West
Coloring of trees with minimum sum of colors. J. Graph Theory 32 (4) (1999)
Tao Jiang, Dhruv Mubayi
Connectivity and separating sets of cages. J. Graph Theory 29 (1) (1998)