Tao Jiang



Department of Mathematics and Statistics
Miami University
Oxford, OH 45056

Phone: 513-529-3422
E-mail: jiangt@muohio.edu

www: http://www.users.muohio.edu/jiangt

Academic Degrees
August, 2000 Ph.D. in Mathematics ,
University of Illinois, Urbana-Champaign.
Area of interest: Graph Theory and Optimization.
Adviser: Douglas B. West
June, 1994 B.Sci. in Computer Science ,
Zhejiang University, P.R. China.
Thesis: Artificial Neural Networks and applications

Academic Positions
July 2006 -- present Associate Professor , Miami University.
August 2001 -- July 2006 Assistant Professor , Miami University.
August 2000 -- August 2001 Assistant Professor , Michigan Technological University.
Courses taught: Graph theory and combinatorics, Calculus using technology.
September 1994 -- June 2000 Teaching/Research assistant , University of Illinois, Urbana-Champaign
Courses taught: Calculus for Engineers, Calculus for Social Scientists, Calculus using technology, Calculus using group learning.

Honors and Professional Memberships
Fall 2007 Distinguished Scholar Award (Junior level), Miami University.
In recognition of research promise and accomplishments of a faculty member within eight years of receiving Ph.D..
Spring 2001 Outstanding Faculty Research Award , Mathematical Sciences, Michigan Technological University
Spring 2000 Hohn-Nash Award , University of Illinois at Urbana-Champaign
In recognition of outstanding scholarship and promise in applied mathematics. Two recipients are selected each year.
August 2000 -- present Institute of Combinatorics and its Applications
August 1994 -- present American Mathematical Society
January 1999 -- present Mathematical Association of America
March 1997 -- present Honor Society of Phi Kappa Phi
Nov. 2003 -- present Marquis' Who's Who in America
Jan 2004 -- present AcademicKeys Who's Who in Sciences Higher Education
Dec. 2006 -- present Marquis Who's Who of Emerging Leaders (first edition)

Grants
Jan 2007 -- Jan 2008/9 NSA Young Investigator Award
"Extremal problems on color structures in edge-colorings of graphs"

Referee/Reviewer
Refereeing for the following journals

Publications
  • Structural and extremal problems in graph theory (Ph.D. dissertation, University of Illinois, 2000. Adviser: Douglas B. West).

  • Connectivity and Separating Sets of Cages (with D. Mubayi), J. Graph Theory 29: 35-44, 1998 (PDF)

  • Coloring of Trees with Minimum Sum of Colors (with D.B. West), J. Graph Theory 32: 354-358, 1999

  • Edge-Bandwidth of Graphs (with D. Mubayi, A. Shastri, and D. B. West), SIAM J. Discrete Math 12: 307-316, 1999 (PDF)

  • New Upper Bounds for a Canonical Ramsey Problem (with D. Mubayi), Combinatorica 20, 141--146, 2000 (PDF)

  • Small odd cycles in 4-chromatic graphs, J. Graph Theory 37, 115 -- 117, 2001 (PDF)

  • Short Even Cycles in Cages with Odd Girth, Ars Combinatoria 59, 165 -- 169, 2001

  • On a conjecture about trees in graphs with large girth, J. Combinatorial Theory Ser. B 83, 221-232, 2001 (PDF)

  • Edge-colorings with no Large Polychromatic Stars, Graphs and Combinatorics 18, 305 -- 308, 2002

  • The Chromatic Spectrum of Mixed Hypergraphs, (with D. Mubayi, Z. Tuza, V. Voloshin, and D.B. West) Graphs and Combinatorics 18, 309 -- 312, 2002

  • Anti-Ramsey numbers of subdivided graphs J. Combinatorial Theory Ser. B, 85, 361 -- 366, 2002 (PDF)

  • Planar Hamiltonian Chordal Graphs are Cycle Extendable Discrete Mathematics vol 257, no 2-3, 441--444, 2002

  • Constrained Ramsey numbers of graphs (with R. Jamison, A. Ling), J. Graph Theory , Vol 42, No. 1, 1-- 16, 2003 (PDF)

  • Vertex disjoint cycles containing prescribed vertices (with Y. Ishigami), J. Graph Theory , vol 42, no 4, 276 -- 296, 2003 (PDF)

  • Isometric cycles and bridged graphs (with S. Kim, D.B. West), J. Graph Theory, vol 43, no 3, 161 -- 170, 2003 (PDF)

  • Bounds on total domination in terms of minimum degree, Bulletin of ICA , vol 38, 101 -- 104, 2003.

  • Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints, (with N. Alon, Z. Miller, D. Pritikin), Random Structures and Algorithms , vol 23, no. 4, 409 -- 433, 2003 (PDF)

  • Local Anti-Ramsey numbers of graphs (with M. Axenovich, Zs. Tuza), Combinatorics, Probability, and Computing, vol 12, no. 5-6 (special issue on Ramsey theory), 495--511, 2003 (PDF)

  • On the Erdos-Simonovits-Sos conjecture about the anti-Ramsey number of a cycle (with D.B. West), Combinatorics, Probability, and Computing, vol 12, no. 5-6 (special issue on Ramsey theory), 585--598, 2003 (PDF)

  • Edge-colorings of complete graphs that avoids polychromatic trees (with D.B. West), Discrete Mathematics, vol 274, 137 -- 145, 2004.

  • Anti-Ramsey numbers of complete bipartite graphs (with M. Axenovich), Ars Combinatoria , vol 73, 311--318, 2004.

  • A note on a conjecture about cycles with many incident chords J. Graph Theory , vol 46, 180-182, 2004.

  • Bipartite anti-Ramsey numbers of cycles and path covers in bipartite graphs (with M. Axenovich, A. Kundgen), J. Graph Theory , vol 47, 9-28, 2004 (PDF)

  • Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes, (with A. Vardy), IEEE Trans. Information Theory , vol 50, no. 8, 1655-1664, 2004 (PDF)

  • On the Steiner, geodetic and hull numbers of graphs (with C. Hernando, M. Mora, I. Pelayo, C. Seara), Discrete Mathematics, vol 293, 139 -- 154, 2005

  • Geodesic convexity and cartesian product in graphs (with I. Pelayo, D. Pritikin), submitted.

  • A lower bound on the order of regular graphs with given girth pair (with C. Balbuena, Y. Lin, X. Marcote, M. Miller), J. Graph Theory, vol 55, 153-163, 2007.

  • Induced Turan Problems: Largest P_m-free graphs with bounded degree (with M.Chung, D. West) , submitted (PDF)

  • The Steiner Problem in the hypercube (with D. Pritikin), in preparation.

  • Turan numbers for bipartite graphs with degree constraints, preprint

  • Edge-bandwidth of the triangular grid (with R. Akhtar, D. Pritikin), Electronic Journal of Combinatorics, 14(1), R67, 2007 (PDF).

  • Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs (with R. Akhtar, Z. Miller), SIAM Journal on Discrete Mathematics, vol 22, no. 2, 425--449, 2008. (PDF).

  • Anti-Ramsey numbers of doubly edge-critical graphs (with O. Pikhurko), submitted.

  • Separation width of trees (with Z. Miller, D. Pritikin), in preparation.

  • Cyclic arrangements of $k$-sets with local intersection constraints (with M. Perkel and D. Pritikin), in preparation.

  • Unordered Canonical Ramsey numbers and properly colored cycles, in preparation.

  • Edge-bandwidth of dense graphs, in preparation.

Invited Talks at conferences
  • Properly colored cycles and rainbow cycles in edge-colored graphs
    Special session on Graph theory, AMS annual meeting, San Diego, CA, Winter 2008.

  • Cyclic arrangements of k-sets with local intersection constraints
    Workshop on extremal graphs and hypergraphs, Carnegie Mellon University, Pittsburgh, PA, Spring 2007.

  • Bounding anti-Ramsey numbers through Turan numbers
    Midwest Graph Theory Meeting XLII, Marion, OH, Spring 2006.

  • Induced Turan problem for graphs with bounded degree
    Special session on Graph theory, AMS sectional meeting Spring 2005, Bowling Green, KY, Spring 2005.

  • The Steiner Problem in the hypercube
    Special session on Extremal Combinatorics, AMS Central sectional meeting Fall 2004, Evanston, IL, Fall 2004

  • The Steiner Problem in the hypercube
    17th Cumberland Conference on Combinatorics, Graph Theory and Computing, Murfreesboro, TN, Spring 2004

  • Constrained Ramsey numbers of graphs
    Special session on graph theory, AMS annual meeting 2002, San Diego, CA, Winter 2002

  • Anti-Ramsey numbers of graphs
    14th Cumberland Conference on Combinatorics, Graph theory and computing, Memphis, TN, Spring 2001

  • Anti-Ramsey numbers of graphs
    AMS 2001 Spring Western section meeting, Las Vegas, Spring 2001

  • "Colorful" trees in edge colorings of graphs
    Special session on beautiful graph theory, AMS/MAA annual meeting, Washington D.C., Winter 2000

  • Embedding trees in graphs with large girth
    Discrete Math Colloquium, Worcester Polytechnic Institute, Fall 99

  • Trees in graphs with large girth
    Clemson Mini-conference on Discrete Mathematics, Clemson University, South Carolina, Fall 99

  • A canonical Ramsey problem
    DREI '99 Program, DIMACS, , Rutgers University, New Jersey, Summer 99.

  • Planar Hamiltonian Chordal Graphs are Cycle Extendable
    DREI '98 Program, DIMACS, Rutgers University, New Jersey, Summer 98.


Other Selected Talks at conferences
  • Vertex-disjoint cycles through specified vertices
    XXXIII Midwest Graph Theory Meeting, Wright State University, Dayton, OH

  • Short odd cycles in 4-chromatic graphs
    The nineth Quadrennial Intl. Conf. on Graph Theory and Combinatorics etc. , Western Michigan University, Kalamazoo, Michigan, Summer 2000

  • Trees in graphs with large girth
    XXXII Midwest Graph Theory Meeting, Indiana University-Purdue University, Fall 99

  • Rainbow trees in edge-colorins of graphs
    13th MCCCC, Illinois State University, Fall 99

  • Edge-colorings with no large polychromatic stars
    DISCMATH Colloquium, Illinois State University, Spring 99.

  • Flashes and Rainbows - A Ramsey Type Problem
    XXX midwest Graph Theory Meeting, Ball State Unversity, Indianda, Fall 98.

  • Planar Hamiltonian Chordal Graphs are Cycle Extendable
    XXIV Midwest Graph Theory Meeting, Michigan State University, Spring 98.

  • Edge-bandwidth of Graphs
    12th MCCCC, Indiana State University, Fall 97.

  • Connectivity of Cages
    Workshop in Combinatorics, University of Louisville, Kentucky, Summer 97.

  • Connectivity and Separating Sets of Cages
    XXVII Midwest Graph Theory Meeting, University of Wisconsin, Oshkosh;