ÿþ<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <!-- saved from url=(0042)http://www.users.muohio.edu/jiangt/cv.html --> <!-- saved from url=(0042)http://www.users.muohio.edu/jiangt/cv.html --><HTML><HEAD><TITLE>Vita</TITLE> <META http-equiv=Content-Type content="text/html; charset=windows-1252"> <META content="MSHTML 6.00.2715.400" name=GENERATOR></HEAD> <BODY bgColor=white> <CENTER> <H2>Tao Jiang </H2></CENTER><BR> <HR> <TABLE cellPadding=4 width="100%" border=0> <TBODY> <TR> <TD align=middle><IMG src="fano.jpg" width=122 hight="105"><BR></TD> <TD align=right> <TABLE border=0> <TBODY> <TR> <TD><FONT size=-1> <P>Department of Mathematics<BR>Miami University <BR>Oxford, OH 45056 </P> <P><B>Phone: </B>513-529-3422 <BR><B>E-mail: </B>jiangt@muohio.edu </P> <P><B>www:</B> <A href="http://www.users.muohio.edu/jiangt">http://www.users.muohio.edu/jiangt</A> </P></FONT></TD></TR></TBODY></TABLE></TD></TR> <TR> <TH align=left colSpan=2><FONT size=+1>Academic Degrees</FONT></TH></TR> <TR> <TD vAlign=top><I>August, 2000 </I></TD> <TD><B>Ph.D. in Mathematics </B>, <BR><A href="http://www.math.uiuc.edu/">University of Illinois, </A>Urbana-Champaign. <BR><I>Area of interest: </I>Graph Theory and Optimization. </FONT><BR><I>Adviser: </I><A href="http://www.math.uiuc.edu/~west">Douglas B. West </A></TD></TR> <TR> <TD vAlign=top><I>June, 1994 </I></TD> <TD><B>B.Sci. in Computer Science </B>, <BR>Zhejiang University, P.R. China. <BR><I>Thesis: </I>Artificial Neural Networks and applications </FONT><BR></TD></TR> <TR> <TH align=left colSpan=2><BR><FONT size=+1>Academic Positions </FONT></TH></TR> <TR> <TD vAlign=top><I>July 2010 -- present </I></TD> <TD><B>Professor </B>, Miami University. <BR></TD></TR> <TR> <TD vAlign=top><I>July 2006 -- June 2010 </I></TD> <TD><B>Associate Professor </B>, Miami University. <BR></TD></TR> <TR> <TD vAlign=top><I>August 2001 -- July 2006 </I></TD> <TD><B>Assistant Professor </B>, Miami University. <BR></TD></TR> <TR> <TD vAlign=top><I>August 2000 -- August 2001 </I></TD> <TD><B>Assistant Professor </B>, Michigan Technological University. <BR></TD></TR> <TR> <TD vAlign=top><I>September 1994 -- June 2000 </I></TD> <TD><B>Teaching/Research assistant </B>, University of Illinois, Urbana-Champaign <BR></TD></TR> <TR> <TH align=left colSpan=2><BR><FONT size=+1>Honors</FONT></TH></TR> <TR> <TD vAlign=top><I>Fall 2007 </I></TD> <TD><B>Distinguished scholar award</B>, Miami University <BR> (In recognition of scholarship of a junior faculty member, one per year, selected campus-wide) </TD></TR> <TR> <TD vAlign=top><I>Spring 2001 </I></TD> <TD><B>Outstanding Faculty Research Award </B>, Mathematical Sciences, Michigan Technological University <BR></TD></TR> <TR> <TD vAlign=top><I>Spring 2000 </I></TD> <TD><B>Hohn-Nash Award </B>, University of Illinois at Urbana-Champaign <BR>(In recognition of outstanding scholarship and promise in applied mathematics. Two recipients are selected each year.)</TD></TR> <TR> <TD vAlign=top><I>March 1997 -- present </I></TD> <TD><B>Honor Society of Phi Kappa Phi </B><BR></TD></TR> <TR> <TH align=left colSpan=2><BR><FONT size=+1>Grants </FONT></TH></TR> <TD vAlign=top><I>1/2007 -- 1/2009 </I></TD> <TD><B> NSA Young Investigator Award</B> <br> <I> "Extremal problems on color structures in edge-colorings of graphs" </I><BR></TD></TR> <TR> <TR> <TR> <TH align=left colSpan=2><BR><FONT size=+1>Recent talks </FONT></TH></TR> <TR> <TH align=left colSpan=2></B> <UL> <LI> "Turan numbers of expanded hypergraphs", Oberwolfach workshop on Hypergraph Turan problems, Oberwolfach, Germany, Spring 2012. </lI> <p></p> <LI> "Co-degree threshold of the Fano plane", Oberwolfach workshop on Hypergraph Turan problems, Oberwolfach, Germany, Spring 2012. </lI> <p></p> <LI> "Set families with a forbidden induced subposet", American Mathematical Society Sectional Meeting, Washington, DC, Spring 2012. </lI> <p></p> <LI> "Turan numbers of expanded hypergraphs", American Mathematical Society Sectional Meeting, Tampa, FL, Spring 2012. </lI> <p></p> <LI> "Hypergraph Turan numbers of uniform linear paths", American Mathematical Society Sectional Meeting, Winston Salem. NC, Fall 2011. </LI> <p></p> <LI> "Turan numbers of subdivided graphs", SIAM-SEAS Southeast Section Meeting, Charlotte, NC, Spring 2011. <p></p> <LI> "Turan numbers of subdivided graphs", American Mathematical Society Sectional Meeting, Richmond, VA, Fall 2010. </LI> <p></p> <LI> "Set systems without a strong simplex", American Mathematical Society Sectional Meeting, St. Paul, MN, Spring 2010. </LI> <p></p> <LI> "Some Turan type results", SIAM Annual Meeting, Denver, CO, Summer 2009. </LI> <p></p> <LI> "Compact topological cliques in sparse graphs", American Mathematical Society Sectional Meeting, Urbana, IL , 2009. </UL> </TR> <TR> <TH align=left colSpan=2><BR><FONT size=+1>Referee/Reviewer </FONT></TH></TR> <TR> <TH align=left colSpan=2></B>Refereeing for the following journals <UL> <LI><A href="http://www.elsevier.nl/inca/publications/store/5/0/5/6/1/0/">Discrete Mathematics</A> <P></P> <LI><A href="http://www.comb.math.keio.ac.jp/G&amp;CHomePage/G&amp;CInformation.html">Graphs and Combinatorics</A> <P></P> <LI><A href=""> IEEE Transactions on Information Theory </A> <P></P> <LI><A href="http://nelligan.la.asu.edu:8087/"> Journal of Combinatorial Theory Ser. A </A> <P></P> <LI><A href="http://www.math.uwaterloo.ca/CandO_Dept/JCTB/jctb.html">Journal of Combinatorial Theory Ser. B</A> <P></P> <LI><A href="http://www.emba.uvm.edu/~jgt">Journal of Graph Theory </A> <P></P> <LI><A href="http://www.interscience.wiley.com/jpages/0028-3045/">Networks </A> <p></p> <LI><A href="http://www.siam.org/journals/sidma/sidma.htm">SIAM J. Discrete Mathematics</A> <P></P></LI></UL> <TR> <TH align=left colSpan=2><BR><FONT size=+1> Publications </FONT></TH></TR> <TH align=left colSpan=2></B> <UL> <LI>On the co-degree threshold for the Fano Plane (with DeBiasio), submitted. <A href="http://www.users.muohio.edu/jiangt/publications/Fano-arxiv.pdf"> (PDF)</A> <P></P> <LI> Exact solution of the hypergraph Turan problem for $k$-uniform linear paths (with Z. Furedi, R. Seiver), submitted.<A href="http://www.users.muohio.edu/jiangt/publications/linear-paths.pdf"> (PDF)</A> <p></p> <LI> Arrangements of k-sets with intersection constraints (with M. Perkel, D. Pritikin), <A href="http://www.journals.elsevier.com/european-journal-of-combinatorics/"> European J. Combinatorics, </A> to appear. <p></p> <LI>Turan numbers of subdivided graphs (with R. Seiver), <A href="http://www.siam.org/journals/sidma/sidma.htm">SIAM Journal on Discrete Math,</A> to appear. <p></p> <LI> Set systems with a forbidden induced suposet (with E. Boehnlein), <A href="http://journals.cambridge.org/action/displayJournal?jid=CPC"> Combinatorics, Probability, and Computing </A>, to appear. <A href="http://www.users.muohio.edu/jiangt/publications/poset-arxiv.pdf"> (PDF)</A> <p></p> <LI>Near optimal bounds for Steiner trees in the hypercube (with Z. Miller, D. Pritikin), <A href="http://www.siam.org/journals/sicomp.php"> SIAM Journal on Computing, </A> 40, #5, 1340-1360, 2011. <A href="http://www.users.muohio.edu/jiangt/publications/steiner.pdf">(PDF) </A> <P></P> <LI>Compact topological minors in graphs, <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory</A>, 67, 139-152, 2011. <A href="http://www.users.muohio.edu/jiangt/publications/top-min-pub.pdf">(PDF) </A> <P></P> <LI>Ramsey numbers of some bipartite graphs versus complete graphs (with M. Salerno) <A href="http://www.springer.com/mathematics/numbers/journal/373">Graphs and Combinatorics</A>, 27, 121-128, 2011 <A href="http://www.users.muohio.edu/jiangt/publications/ramsey-theta-published.pdf">(PDF)</A> <P></P> <LI>Set systems without a strong simplex (with O. Pikhurko and Z. Yilma), <A href="http://www.siam.org/journals/sidma/sidma.htm">SIAM Journal on Discrete Math</A> 24, #3, 1038-1045, 2010. <A href="http://www.users.muohio.edu/jiangt/publications/simplex-published.pdf">(PDF)</A> <P></P> <LI>Induced Turan Problems: Largest P_m-free graphs with bounded degree (with M.Chung, D. West), under revision. <P></P> <LI>Separation numbers of trees (with Z. Miller, D. Pritikin) <A href="http://www.elsevier.com/wps/find/journaldescription.cws_home/505625/description#description">Theoretical Computer Science</A>, published online May, 2009, <A href="http://www.users.muohio.edu/jiangt/publications/sep-tree.pdf">(PDF)</A>. <P></P> <LI>Canonical Ramsey numbers and properly colored cycles <A href="http://www.elsevier.com/wps/find/journaldescription.cws_home/505610/description#description">Discrete Mathematics </A>309, 4247-4252, 2009. <A href="http://www.users.muohio.edu/jiangt/publications/canon-cycle.pdf">(PDF)</A> <P></P> <LI>Anti-Ramsey numbers of doubly edge-critical graphs (with O. Pikhurko),<A href="http://www.interscience.wiley.com/jpages/0364-9024/"> J. Graph Theory</A> 61, 210-218, 2009. <A href="http://www.users.muohio.edu/jiangt/publications/anti-critical.pdf">(PDF) </A> <P></P> <LI>Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs (with R. Akhtar, Z. Miller), <A href="http://www.siam.org/journals/sidma/sidma.htm">SIAM J. Discrete Math</A>, vol 22, no. 2, 425--449, 2008. <A href="http://www.users.muohio.edu/jiangt/publications/edge-Hamming.pdf">(PDF)</A> <P></P> <LI>Edge-bandwidth of the triangular grid (with R. Akhtar, D. Pritikin), <A href="http://www.combinatorics.org/">Electronic Journal of Combinatorics</A> 14(1), R67, 2007. <A href="http://www.users.muohio.edu/jiangt/publications/triangular-grids.pdf">(PDF)</A> <P></P> <LI>A lower bound on the order of regular graphs with given girth pair (with C. Balbuena, Y. Lin, X. Marcote, M. Miller), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory</A>, vol 55, 153-163, 2007. <P></P> <LI>On the Steiner, geodetic and hull numbers of graphs (with C. Hernando, M. Mora, I. Pelayo, C. Seara), <A href="http://www.elsevier.nl/inca/publications/store/5/0/5/6/1/0/">Discrete Mathematics</A>, vol 293, 139 -- 154, 2005 <P></P> <LI>Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes, (with A. Vardy), <A href="http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?puNumber=18">IEEE Trans. Information Theory </A>, vol 50, no. 8, 1655-1664, 2004 <A href="http://www.users.muohio.edu/jiangt/publications/gilbert.pdf">(PDF)</A> <P></P> <LI>Bipartite anti-Ramsey numbers of cycles and path covers in bipartite graphs (with M. Axenovich, A. Kundgen), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory </A>, vol 47, 9-28, 2004 <A href="http://www.users.muohio.edu/jiangt/publications/bipartite.pdf">(PDF)</A> <P></P> <LI>A note on a conjecture about cycles with many incident chords<A href="http://www.interscience.wiley.com/jpages/0364-9024/"> J. Graph Theory </A>, vol 46, 180-182, 2004. <P></P> <LI>Anti-Ramsey numbers of complete bipartite graphs (with M. Axenovich), <A href="http://www.users.muohio.edu/jiangt/">Ars Combinatoria </A>, vol 73, 311--318, 2004. <P></P> <LI>Edge-colorings of complete graphs that avoids polychromatic trees (with D.B. West), <A href="http://www.elsevier.nl/inca/publications/store/5/0/5/6/1/0/">Discrete Mathematics</A>, vol 274, 137 -- 145, 2004. <P></P> <LI>On the Erdos-Simonovits-Sos conjecture about the anti-Ramsey number of a cycle (with D.B. West), <A href="http://titles.cambridge.org/journals/journal_catalogue.asp?mnemonic=cpc">Combinatorics, Probability, and Computing</A>, vol 12, no. 5-6 (special issue on Ramsey theory), 585--598, 2003 <A href="http://www.users.muohio.edu/jiangt/publications/ESS.pdf">(PDF)</A> <P></P> <LI>Local Anti-Ramsey numbers of graphs (with M. Axenovich, Zs. Tuza), <A href="http://titles.cambridge.org/journals/journal_catalogue.asp?mnemonic=cpc">Combinatorics, Probability, and Computing</A>, vol 12, no. 5-6 (special issue on Ramsey theory), 495--511, 2003 <A href="http://www.users.muohio.edu/jiangt/publications/local.pdf">(PDF)</A> <P></P> <LI>Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints, (with N. Alon, Z. Miller, D. Pritikin), <A href="http://www.interscience.wiley.com/jpages/1042-9832/">Random Structures and Algorithms </A>, vol 23, no. 4, 409 -- 433, 2003 <A href="http://www.users.muohio.edu/jiangt/publications/proper-color.pdf">(PDF)</A> <P></P> <LI>Bounds on total domination in terms of minimum degree, <A href="http://www.users.muohio.edu/jiangt/tmp">Bulletin of ICA </A>, vol 38, 101 -- 104, 2003. <P></P> <LI>Isometric cycles and bridged graphs (with S. Kim, D.B. West), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory</A>, vol 43, no 3, 161 -- 170, 2003 <A href="http://www.users.muohio.edu/jiangt/publications/bridged.pdf">(PDF)</A> <P></P> <LI>Vertex disjoint cycles containing prescribed vertices (with Y. Ishigami), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory </A>, vol 42, no 4, 276 -- 296, 2003 <A href="http://www.users.muohio.edu/jiangt/publications/vd-cycles.pdf">(PDF)</A> <P></P> <LI>Constrained Ramsey numbers of graphs (with R. Jamison, A. Ling), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory </A>, Vol 42, No. 1, 1-- 16, 2003 <A href="http://www.users.muohio.edu/jiangt/publications/constrained.pdf">(PDF)</A> <P></P> <LI>Planar Hamiltonian Chordal Graphs are Cycle Extendable <A href="http://www.elsevier.nl/inca/publications/store/5/0/5/6/1/0/">Discrete Mathematics</A> vol 257, no 2-3, 441--444, 2002 <P></P> <LI>Anti-Ramsey numbers of subdivided graphs <A href="http://www.math.uwaterloo.ca/CandO_Dept/JCTB/jctb.html">J. Combinatorial Theory Ser. B</A>, 85, 361 -- 366, 2002 <A href="http://www.users.muohio.edu/jiangt/publications/subdivided.pdf">(PDF)</A> <P></P> <LI>The Chromatic Spectrum of Mixed Hypergraphs, (with D. Mubayi, Z. Tuza, V. Voloshin, and D.B. West) <A href="http://www.comb.math.keio.ac.jp/G&amp;CHomePage/G&amp;CInformation.html">Graphs and Combinatorics</A> 18, 309 -- 312, 2002 <P></P> <LI>Edge-colorings with no Large Polychromatic Stars, <A href="http://www.comb.math.keio.ac.jp/G&amp;CHomePage/G&amp;CInformation.html">Graphs and Combinatorics</A> 18, 305 -- 308, 2002 <P></P> <LI>On a conjecture about trees in graphs with large girth, <A href="http://www.math.uwaterloo.ca/CandO_Dept/JCTB/jctb.html">J. Combinatorial Theory Ser. B</A> 83, 221-232, 2001 <A href="http://www.users.muohio.edu/jiangt/publications/tree-embedding.pdf">(PDF)</A> <P></P> <LI>Short Even Cycles in Cages with Odd Girth, <A href="http://kohlrabi.cs.umanitoba.ca/ArsComb/ArsComb.html">Ars Combinatoria </A>59, 165 -- 169, 2001 <P></P> <LI>Small odd cycles in 4-chromatic graphs, <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory </A>37, 115 -- 117, 2001 <A href="http://www.users.muohio.edu/jiangt/publications/odd-cycle.pdf">(PDF)</A> <P></P> <LI>New Upper Bounds for a Canonical Ramsey Problem (with D. Mubayi), <A href="http://link.springer.de/link/service/journals/00493/index.htm">Combinatorica</A></FONT> 20, 141--146, 2000 <A href="http://www.users.muohio.edu/jiangt/publications/flash-rainbow.pdf">(PDF)</A> <P></P> <LI>Edge-Bandwidth of Graphs (with D. Mubayi, A. Shastri, and D. B. West), <A href="http://www.siam.org/journals/sidma/sidma.htm">SIAM J. Discrete Math</A> 12: 307-316, 1999 <A href="http://www.users.muohio.edu/jiangt/publications/edge-band.pdf">(PDF) </A> <P></P> <LI>Coloring of Trees with Minimum Sum of Colors (with D.B. West), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory</A> 32: 354-358, 1999 <P></P> <LI>Connectivity and Separating Sets of Cages (with D. Mubayi), <A href="http://www.interscience.wiley.com/jpages/0364-9024/">J. Graph Theory</A> 29: 35-44, 1998 <A href="http://www.users.muohio.edu/jiangt/publications/cages.pdf">(PDF)</A> <P></P> <LI><A href="http://www.users.muohio.edu/jiangt/thesis.ps">Structural and extremal problems in graph theory </A>(Ph.D. dissertation, University of Illinois, 2000. Adviser: Douglas B. West). <P></P></LI></UL> </TR> </TR></TR></TBODY></TABLE></HMTL></BODY></HTML>