Tao Jiang

According to our database1, Tao Jiang authored at least 46 papers between 1998 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
New bounds for a hypergraph bipartite Turán problem.
J. Comb. Theory, Ser. A, 2020

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.
Discret. Appl. Math., 2020

2019
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.
SIAM J. Discret. Math., 2019

2017
On the bandwidth of the Kneser graph.
Discret. Appl. Math., 2017

2014
Hypergraph Turán numbers of linear cycles.
J. Comb. Theory, Ser. A, 2014

On the co-degree threshold for the Fano plane.
Eur. J. Comb., 2014

Exact solution of the hypergraph Turán problem for k-uniform linear paths.
Comb., 2014

2013
Degree Ramsey numbers for cycles and blowups of trees.
Eur. J. Comb., 2013

2012
Turán Numbers of Subdivided Graphs.
SIAM J. Discret. Math., 2012

Arrangements of k-sets with intersection constraints.
Eur. J. Comb., 2012

Set Families With a Forbidden Induced Subposet.
Comb. Probab. Comput., 2012

2011
Near Optimal Bounds for Steiner Trees in the Hypercube.
SIAM J. Comput., 2011

Compact topological minors in graphs.
J. Graph Theory, 2011

Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs.
Graphs Comb., 2011

2010
Set Systems without a Strong Simplex.
SIAM J. Discret. Math., 2010

2009
Separation numbers of trees.
Theor. Comput. Sci., 2009

Anti-Ramsey numbers of doubly edge-critical graphs.
J. Graph Theory, 2009

Canonical Ramsey numbers and properly colored cycles.
Discret. Math., 2009

2008
Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs.
SIAM J. Discret. Math., 2008

2007
Edge-Bandwidth of the Triangular Grid.
Electron. J. Comb., 2007

2005
On the Steiner, geodetic and hull numbers of graphs.
Discret. Math., 2005

2004
Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes.
IEEE Trans. Inf. Theory, 2004

A note on a conjecture about cycles with many incident chords.
J. Graph Theory, 2004

Bipartite anti-Ramsey numbers of cycles.
J. Graph Theory, 2004

Anti-Ramsey numbers for small complete bipartite graphs.
Ars Comb., 2004

2003
Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints.
Random Struct. Algorithms, 2003

Isometric cycles, cutsets, and crowning of bridged graphs.
J. Graph Theory, 2003

Constrained Ramsey numbers of graphs.
J. Graph Theory, 2003

Vertex-disjoint cycles containing prescribed vertices.
J. Graph Theory, 2003

On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle.
Comb. Probab. Comput., 2003

Local Anti-Ramsey Numbers of Graphs.
Comb. Probab. Comput., 2003

2002
Anti-Ramsey Numbers of Subdivided Graphs.
J. Comb. Theory, Ser. B, 2002

The Chromatic Spectrum of Mixed Hypergraphs.
Graphs Comb., 2002

Edge-Colorings with No Large Polychromatic Stars.
Graphs Comb., 2002

Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees.
Electron. Notes Discret. Math., 2002

Planar Hamiltonian chordal graphs are cycle extendable.
Discret. Math., 2002

2001
Small odd cycles in 4-chromatic graphs.
J. Graph Theory, 2001

On a Conjecture about Trees in Graphs with Large Girth.
J. Comb. Theory, Ser. B, 2001

Short Even Cycles In Cages With Odd Girth.
Ars Comb., 2001

2000
Correction to Edge-Bandwidth of Graphs.
SIAM J. Discret. Math., 2000

Perfection thickness of graphs.
Discret. Math., 2000

New Upper Bounds for a Canonical Ramsey Problem.
Comb., 2000

1999
Edge-Bandwidth of Graphs.
SIAM J. Discret. Math., 1999

Coloring of trees with minimum sum of colors.
J. Graph Theory, 1999

Chromatic spectrum is broken.
Electron. Notes Discret. Math., 1999

1998
Connectivity and separating sets of cages.
J. Graph Theory, 1998


  Loading...