{"id":12,"date":"2021-12-20T16:36:24","date_gmt":"2021-12-20T21:36:24","guid":{"rendered":"https:\/\/sites.miamioh.edu\/jiangt\/?page_id=12"},"modified":"2026-05-05T09:17:58","modified_gmt":"2026-05-05T13:17:58","slug":"12-2","status":"publish","type":"page","link":"https:\/\/sites.miamioh.edu\/jiangt\/12-2\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<ul class=\"wp-block-list\">\n<li> Induced rational exponents nears two (with S. Longbrake),\narxiv <a href=\"https:\/\/arxiv.org\/abs\/2604.05288\"> (PDF) <\/a><\/li>\n\n<li> On the number of families avoiding a subposet (with S. Longbrake, L. Yepremyan),\narxiv. <a href=\"https:\/\/arxiv.org\/abs\/2603.23431\">(PDF) <\/a> <\/li>\n<li> Regularization and asymmetric extremal numbers of subdivisions (with S. Longbrake), submitted.\n<a href=\"https:\/\/arxiv.org\/abs\/2507.03261\"> (PDF) <\/a><\/li>\n\n<li> On the number of H-free hypergraphs (with S. Longbrake), \n<a href=\"https:\/\/www.cambridge.org\/core\/journals\/forum-of-mathematics-sigma\">\nForum of Math, Sigma <\/a>, vol 14, e20, 2026. <a href=\"http:\/\/sites.miamioh.edu\/jiangt\/files\/2026\/03\/number-H-free-pub.pdf\"> (PDF) <\/a> <\/li>\n\n<li> Tree posets: Supersaturation, Enumeration, and Randomness, (with S. Longbrake, S. Spiro, L. Yepremyan), <a href=\"https:\/\/www.cambridge.org\/core\/journals\/canadian-journal-of-mathematics\">\nCanadian Journal of Mathematics<\/a>, published online, October 3, 2025.  <a href=\"https:\/\/arxiv.org\/abs\/2406.11999\"> (PDF)<\/a>\n<\/li>\n<li> Balanced supersaturation and Turan numbers in random graphs (with S. Longbrake), \n<a \/> Advances in Combinatorics <\/a>, paper no. 3, 625-644, 2024. \n<a href=\"https:\/\/arxiv.org\/pdf\/2208.10572.pdf\"> (PDF) <\/a> <\/li>\n\n<li> Rainbow subdivisions of cliques (with S. Letzter, A. Methuku, L. Yepremyan),\n<a href=\"\u201c\"> Random Structures and Algorithms <\/a>, vol 64, 625-644, 2024. <a href=\"https:\/\/arxiv.org\/abs\/2108.08814\">\n(PDF) <\/a><\/li>\n\n<li> Rainbow Turan number of clique subdivisions (with A. Methuku, L. Yepremyan),\n<a href=\"\/\/www.sciencedirect.com\/journal\/european-journal-of-combinatorics\u201c\">\nEuropean Journal of Combinatorics <\/a>, vol 110, paper no. 103675, 8pp, 2023. \n<a href=\"https:\/\/arxiv.org\/abs\/2106.13803\"> (PDF)<\/a><\/li>\n\n<li> Bipartite-ness under smooth conditions (with S. Longbrake, J. Ma),\n<a href=\"\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\u201d\">Combinatorics, Probability, and Computing <\/a>, vol 32, 546-558, 2023. \n<a href=\"https:\/\/arxiv.org\/abs\/2109.01311\"> (PDF)<\/a> <\/li>\n\n<li> Extremal problems for hypergraph blowups of trees, (with Z. Furedi, A. Kostochka, D. Mubayi, J, Verstraete), <a href=\"https:\/\/www.siam.org\/publications\/siam-journals\/siam-journal-on-discrete-mathematics\/\"> SIAM Journal on Discrete Mathematics <\/a>, vol 37, 2397-2416, 2023.<a href=\"https:\/\/arxiv.org\/abs\/2003.00622\"> (PDF) <\/a> <\/li>\n\n<li> Tree-degenerate graphs and nested dependent random choice, (with S. Longbrake),\n<a href=\"https:\/\/www.siam.org\/publications\/siam-journals\/siam-journal-on-discrete-mathematics\/\">\n SIAM Journal on Discrete Mathematics <\/a>, vol 37, 1805-1817, 2023.\n<a href=\"https:\/\/arxiv.org\/abs\/2201.10699\"> (PDF)<\/a><\/li>\n\n<li> Linear cycles of consecutive lengths, (with J. Ma, L. Yepremyan),&nbsp;<a href=\"https:\/\/www.journals.elsevier.com\/journal-of-combinatorial-theory-series-b\">, Journal of Cominatorial Theory Series B&nbsp;<\/a>, vol 163, 1-24, 2023.<a href=\"https:\/\/arxiv.org\/pdf\/2006.13206.pdf\">(PDF)<\/a><\/li>\n\n<li> Many Turan exponents via subdivisions (with Y. Qiu), <a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\">Combinatotics, Probability, and Computing<\/a>, vol 32, 134-150, 2023. <a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2025\/01\/Many-Turan-exponents.pdf\">(PDF)<\/a><\/li>\n\n<li> Negiligible obstructions and Turan exponents (with Z. Jiang and J. Ma), Annals of Applied Math., vol 38, 356-384, 2022. <a href=\"\/\/arxiv.org\/pdf\/2007.02975.pdf\u201d\">(PDF)<\/a><\/li>\n\n<li>On Turan exponents of bipartite graphs (with J. Ma, L. Yepremyan),&nbsp;<a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\">Combinatorics, Probability, and Computing&nbsp;<\/a>, 31, 333-344, 2022.&nbsp;<a href=\"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/\n939E454E5E6B3E2BE414B820D3B36B56\/S0963548321000341a.pdf\/on_turan_exponents_of_bipartite_graphs.pdf\">(PDF)<\/a><\/li>\n\n<li>Partitioning ordered hypergraphs (with Z. Furedi, D. Mubayi, A. Kostochka, J. Verstraete)&nbsp;<a href=\"https:\/\/www.journals.elsevier.com\/journal-of-combinatorial-theory-series-a\">Journal of Combinatorial Theory, Series A, 177, paper No. 105300, 18pp, 2021&nbsp;<\/a><a href=\"https:\/\/arxiv.org\/pdf\/1906.03342.pdf\">(<\/a><a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/JCTA-partition-2021.pdf\">PDF<\/a><a href=\"https:\/\/arxiv.org\/pdf\/1906.03342.pdf\">)<\/a><\/li>\n\n<li> Supersaturation of even linear cycles in linear hypergraphs (with L. Yepremyan),&nbsp;<a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\">Combinatotics, Probability, and Computing<\/a>, 29, 698-721, 2020&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/supersaturation-cpc.pdf\">(PDF)<\/a><\/li>\n\n<li> Turan numbers of bipartite subdivisions, (with Y. Qiu),&nbsp;<a href=\"https:\/\/www.siam.org\/publications\/journals\/siam-journal-on-discrete-mathematics-sidma\">SIAM Journal on Discrete Mathematics&nbsp;<\/a>, 34, 556-570, 2020.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/wp-admin\/post.php?post=65&amp;action=edit#:~:text=http%3A\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/bipartite%2Dsubdivision%2D2020.pdf\">(<\/a><a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/bipartite-subdivision-2020.pdf\">PDF<\/a><a href=\"https:\/\/sites.miamioh.edu\/jiangt\/wp-admin\/post.php?post=65&amp;action=edit#:~:text=http%3A\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/bipartite%2Dsubdivision%2D2020.pdf\">)<\/a><\/li>\n\n<li> New bounds for a hypergraph bipartite Turan problem (with B. Ergemlidze, A. Methuku),&nbsp;<a href=\"https:\/\/www.journals.elsevier.com\/journal-of-combinatorial-theory-series-a\">Journal of Combinatorial Theory, Series A, 176, paper No. 105299, 18pp, 2020.&nbsp;<\/a><a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/hyperTuran-jcta.pdf\">(PDF)<\/a><\/li><li>Tight paths in convex geometric hypergraphs (with Z. Furedi, D. Mubayi, A. Kostochka, J. Verstraete),&nbsp;<a href=\"https:\/\/www.advancesincombinatorics.com\/about\">Advances in Combinatorics, paper No. 1, 14pp, 2020.&nbsp;<\/a><a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/tight-paths-advcomb-2020.pdf\">(PDF)<\/a><\/li>\n\n<li> Hypergraphs not containing a tight tree with a bounded trunk (with Z. Furedi, A. Kostochka, D. Mubayi, J. Verstraete),&nbsp;<a href=\"https:\/\/www.siam.org\/publications\/journals\/siam-journal-on-discrete-mathematics-sidma\">SIAM Journal on Discrete Mathematics,&nbsp;<\/a>33, 862-873, 2019.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/trunk-sidma.pdf\">(PDF)<\/a><\/li><li>Turan numbers of hypergraph trees (with Z. Furedi)&nbsp;<a href=\"www.journals.elsevier.com\/journal-of-combinatorial-theory-series-a\/\">Journal of Combinatorial Theory Series A&nbsp;<\/a>, accepted.&nbsp;<a href=\"https:\/\/arxiv.org\/abs\/1505.03210\">(PDF)<\/a><\/li><li>Cycles of given lengths in hypergraphs (with J. Ma)&nbsp;<a href=\"https:\/\/www.journals.elsevier.com\/journal-of-combinatorial-theory-series-b\">Journal of combinatorial Theory Series B,&nbsp;<\/a>133, 54-77, 2018.&nbsp;<a href=\"http:\/\/users.miamioh.edu\/jiangt\/publications\/cycles-jctb.pdf\">(<\/a><a href=\"http:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/cycles-jctb.pdf\" data-type=\"URL\" data-id=\"http:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/cycles-jctb.pdf\">PDF<\/a><a href=\"http:\/\/users.miamioh.edu\/jiangt\/publications\/cycles-jctb.pdf\">)<\/a><\/li><li>Turan numbers of extensions of some sparse hypergraphs via Lagrangians (with Y. Peng and B. Wu),&nbsp;<a href=\"https:\/\/www.journals.elsevier.com\/european-journal-of-combinatorics\">European Journal of Combinatorics<\/a>73, 20-26, 2018.<\/li><li>Linear Turan numbers of r-uniform linear cycles and related Ramsey numbers (with C. Collier-Cartaino and N. Graber),&nbsp;<a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\">Combinatorics, Probability, and Computing<\/a>&nbsp;27, 358-386, 2018.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/linear-cycles-cpc.pdf\">(PDF)<\/a><\/li><li>Stability and Turan numbers of a class of hypergraphs via Lagranges (with A. Brandt and D. Irwin),&nbsp;<a href=\"https:\/\/www.cambridge.org\/core\/journals\/combinatorics-probability-and-computing\">Combinatorics, Probability, and Computing<\/a>&nbsp;26, 367-405, 2017.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/stability-cpc.pdf\">(PDF)<\/a><\/li><li>Small dense subgraphs of a graph (with A. Newman),&nbsp;<a href=\"https:\/\/www.siam.org\/publications\/journals\/siam-journal-on-discrete-mathematics-sidma\">SIAM Journal on Discrete Mathematics&nbsp;<\/a>, 31, 124-142, 2017.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/small-dense-sidma.pdf\">(PDF)<\/a><\/li><li>Hypergraph Turan numbers of linear cycles (with Z. Furedi),&nbsp;<a href=\"www.journals.elsevier.com\/journal-of-combinatorial-theory-series-a\/\">Journal of Combinatorial Theory Series A&nbsp;<\/a>, 123, 252-270, 2014.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/linear-cycles-jcta.pdf\">(PDF)<\/a><\/li><li>On the co-degree threshold for the Fano Plane (with DeBiasio),&nbsp;<a href=\"http:\/\/www.journals.elsevier.com\/european-journal-of-combinatorics\/\">European J. Combinatorics,&nbsp;<\/a>, 36, 151-158, 2014.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/Fano-2014.pdf\">(PDF)<\/a><\/li><li>Exact solution of the hypergraph Turan problem for $k$-uniform linear paths (with Z. Furedi, R. Seiver),&nbsp;<a href=\"http:\/\/www.springer.com\/new+%26+forthcoming+titles+(default)\/journal\/493\">Combinatorica&nbsp;<\/a>34, 299-322, 2014.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/linear-paths-Combinatorica.pdf\">(PDF)<\/a><\/li><li>Degree Ramsey numbers for cycles and blowups of tree (with K. Milans, D.B. West),&nbsp;<a href=\"http:\/\/www.journals.elsevier.com\/european-journal-of-combinatorics\/\">European J. Combinatorics,&nbsp;<\/a>, 34, #2, 414-423, 2013.<\/li><li>Turan numbers of subdivided graphs (with R. Seiver),&nbsp;<a href=\"http:\/\/www.siam.org\/journals\/sidma\/sidma.htm\">SIAM Journal on Discrete Math,<\/a>&nbsp;26, #3, 1238-1255, 2012.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/subdivided-sidma.pdf\">(PDF)<\/a><\/li><li>Arrangements of k-sets with intersection constraints (with M. Perkel, D. Pritikin),&nbsp;<a href=\"http:\/\/www.journals.elsevier.com\/european-journal-of-combinatorics\/\">European J. Combinatorics,&nbsp;<\/a>33, 1882-1899, 2012.<\/li><li>Set systems with a forbidden induced suposet (with E. Boehnlein),&nbsp;<a href=\"http:\/\/journals.cambridge.org\/action\/displayJournal?jid=CPC\">Combinatorics, Probability, and Computing&nbsp;<\/a>, 21, #4, 496-511, 2012.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/posets-cpc.pdf\">(PDF)<\/a><\/li><li>Near optimal bounds for Steiner trees in the hypercube (with Z. Miller, D. Pritikin),&nbsp;<a href=\"http:\/\/www.siam.org\/journals\/sicomp.php\">SIAM Journal on Computing,&nbsp;<\/a>40, #5, 1340-1360, 2011.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/Steiner-SIAM.pdf\">(PDF)<\/a><\/li><li>Compact topological minors in graphs,&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory<\/a>, 67, 139-152, 2011.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/Top-min-JGT.pdf\">(PDF)<\/a><\/li><li>Ramsey numbers of some bipartite graphs versus complete graphs (with M. Salerno)&nbsp;<a href=\"http:\/\/www.springer.com\/mathematics\/numbers\/journal\/373\">Graphs and Combinatorics<\/a>, 27, 121-128, 2011&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/ramsey-theta-published.pdf\">(PDF)<\/a><\/li><li>Set systems without a strong simplex (with O. Pikhurko and Z. Yilma),&nbsp;<a href=\"http:\/\/www.siam.org\/journals\/sidma\/sidma.htm\">SIAM Journal on Discrete Math<\/a>&nbsp;24, #3, 1038-1045, 2010.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/simplex-sidma.pdf\">(PDF)<\/a><\/li><li>Induced Turan Problems: Largest P_m-free graphs with bounded degree (with M.Chung, D. West), under revision.<\/li><li>Separation numbers of trees (with Z. Miller, D. Pritikin)&nbsp;<a href=\"http:\/\/www.elsevier.com\/wps\/find\/journaldescription.cws_home\/505625\/description#description\">Theoretical Computer Science<\/a>, published online May, 2009,&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/sep-tree.pdf\">(PDF)<\/a>.<\/li><li>Canonical Ramsey numbers and properly colored cycles&nbsp;<a href=\"http:\/\/www.elsevier.com\/wps\/find\/journaldescription.cws_home\/505610\/description#description\">Discrete Mathematics&nbsp;<\/a>309, 4247-4252, 2009.&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/canon-cycle.pdf\">(PDF)<\/a><\/li><li>Anti-Ramsey numbers of doubly edge-critical graphs (with O. Pikhurko),<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">&nbsp;J. Graph Theory<\/a>&nbsp;61, 210-218, 2009.&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/anti-critical.pdf\">(PDF)<\/a><\/li><li>Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs (with R. Akhtar, Z. Miller),&nbsp;<a href=\"http:\/\/www.siam.org\/journals\/sidma\/sidma.htm\">SIAM J. Discrete Math<\/a>, vol 22, no. 2, 425&#8211;449, 2008.&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/grid-sidma.pdf\">(PDF)<\/a><\/li><li>Edge-bandwidth of the triangular grid (with R. Akhtar, D. Pritikin),&nbsp;<a href=\"http:\/\/www.combinatorics.org\/\">Electronic Journal of Combinatorics<\/a>&nbsp;14(1), R67, 2007.&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/triangular-grids.pdf\">(PDF)<\/a><\/li><li>A lower bound on the order of regular graphs with given girth pair (with C. Balbuena, Y. Lin, X. Marcote, M. Miller),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory<\/a>, vol 55, 153-163, 2007.<\/li><li>On the Steiner, geodetic and hull numbers of graphs (with C. Hernando, M. Mora, I. Pelayo, C. Seara),&nbsp;<a href=\"http:\/\/www.elsevier.nl\/inca\/publications\/store\/5\/0\/5\/6\/1\/0\/\">Discrete Mathematics<\/a>, vol 293, 139 &#8212; 154, 2005<\/li><li>Asymptotic improvement of the Gilbert-Varshamov bound on the size of binary codes, (with A. Vardy),&nbsp;<a href=\"http:\/\/ieeexplore.ieee.org\/xpl\/RecentIssue.jsp?puNumber=18\">IEEE Trans. Information Theory&nbsp;<\/a>, vol 50, no. 8, 1655-1664, 2004&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/Gilbert-IEEE.pdf\">(PDF)<\/a><\/li><li>Bipartite anti-Ramsey numbers of cycles and path covers in bipartite graphs (with M. Axenovich, A. Kundgen),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory&nbsp;<\/a>, vol 47, 9-28, 2004&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/bipartite.pdf\">(PDF)<\/a><\/li><li>A note on a conjecture about cycles with many incident chords<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">&nbsp;J. Graph Theory&nbsp;<\/a>, vol 46, 180-182, 2004.<\/li><li>Anti-Ramsey numbers of complete bipartite graphs (with M. Axenovich),&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/\">Ars Combinatoria&nbsp;<\/a>, vol 73, 311&#8211;318, 2004.<\/li><li>Edge-colorings of complete graphs that avoids polychromatic trees (with D.B. West),&nbsp;<a href=\"http:\/\/www.elsevier.nl\/inca\/publications\/store\/5\/0\/5\/6\/1\/0\/\">Discrete Mathematics<\/a>, vol 274, 137 &#8212; 145, 2004.<\/li><li>On the Erdos-Simonovits-Sos conjecture about the anti-Ramsey number of a cycle (with D.B. West),&nbsp;<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&#8211;598, 2003&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/ESS.pdf\">(PDF)<\/a><\/li><li>Local Anti-Ramsey numbers of graphs (with M. Axenovich, Zs. Tuza),&nbsp;<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&#8211;511, 2003&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/local.pdf\">(PDF)<\/a><\/li><li>Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints, (with N. Alon, Z. Miller, D. Pritikin),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/1042-9832\/\">Random Structures and Algorithms&nbsp;<\/a>, vol 23, no. 4, 409 &#8212; 433, 2003&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/proper-rainbow-RSA.pdf\">(PDF)<\/a><\/li><li>Bounds on total domination in terms of minimum degree,&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/tmp\">Bulletin of ICA&nbsp;<\/a>, vol 38, 101 &#8212; 104, 2003.<\/li><li>Isometric cycles and bridged graphs (with S. Kim, D.B. West),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory<\/a>, vol 43, no 3, 161 &#8212; 170, 2003&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/bridged.pdf\">(PDF)<\/a><\/li><li>Vertex disjoint cycles containing prescribed vertices (with Y. Ishigami),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory&nbsp;<\/a>, vol 42, no 4, 276 &#8212; 296, 2003&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/vd-cycles.pdf\">(PDF)<\/a><\/li><li>Constrained Ramsey numbers of graphs (with R. Jamison, A. Ling),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory&nbsp;<\/a>, Vol 42, No. 1, 1&#8211; 16, 2003&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/constrained.pdf\">(PDF)<\/a><\/li><li>Planar Hamiltonian Chordal Graphs are Cycle Extendable&nbsp;<a href=\"http:\/\/www.elsevier.nl\/inca\/publications\/store\/5\/0\/5\/6\/1\/0\/\">Discrete Mathematics<\/a>&nbsp;vol 257, no 2-3, 441&#8211;444, 2002<\/li>\n<li>Anti-Ramsey numbers of subdivided graphs\n<a href=\"http:\/\/www.math.uwaterloo.ca\/CandO_Dept\/JCTB\/jctb.html\">J. Combinatorial Theory Ser. B<\/a>, \n85, 361 &#8212; 366, 2002\n<a href=\"http:\/\/sites.miamioh.edu\/jiangt\/files\/2026\/04\/anti-Ramsey-subdivided.pdf\">(PDF)<\/a>\n<\/li><li>The Chromatic Spectrum of Mixed Hypergraphs, (with D. Mubayi, Z. Tuza, V. Voloshin, and D.B. West)&nbsp;<a href=\"http:\/\/www.comb.math.keio.ac.jp\/G&amp;CHomePage\/G&amp;CInformation.html\">Graphs and Combinatorics<\/a>&nbsp;18, 309 &#8212; 312, 2002<\/li><li>Edge-colorings with no Large Polychromatic Stars,&nbsp;<a href=\"http:\/\/www.comb.math.keio.ac.jp\/G&amp;CHomePage\/G&amp;CInformation.html\">Graphs and Combinatorics<\/a>&nbsp;18, 305 &#8212; 308, 2002<\/li><li>On a conjecture about trees in graphs with large girth,&nbsp;<a href=\"http:\/\/www.math.uwaterloo.ca\/CandO_Dept\/JCTB\/jctb.html\">J. Combinatorial Theory Ser. B<\/a>&nbsp;83, 221-232, 2001&nbsp;<a href=\"https:\/\/sites.miamioh.edu\/jiangt\/files\/2021\/12\/tree-jctb.pdf\">(PDF)<\/a><\/li><li>Short Even Cycles in Cages with Odd Girth,&nbsp;<a href=\"http:\/\/kohlrabi.cs.umanitoba.ca\/ArsComb\/ArsComb.html\">Ars Combinatoria&nbsp;<\/a>59, 165 &#8212; 169, 2001<\/li><li>Small odd cycles in 4-chromatic graphs,&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory&nbsp;<\/a>37, 115 &#8212; 117, 2001&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/odd-cycle.pdf\">(PDF)<\/a><\/li><li>New Upper Bounds for a Canonical Ramsey Problem (with D. Mubayi),&nbsp;<a href=\"http:\/\/link.springer.de\/link\/service\/journals\/00493\/index.htm\">Combinatorica<\/a>&nbsp;20, 141&#8211;146, 2000&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/flash-rainbow.pdf\">(PDF)<\/a><\/li><li>Edge-Bandwidth of Graphs (with D. Mubayi, A. Shastri, and D. B. West),&nbsp;<a href=\"http:\/\/www.siam.org\/journals\/sidma\/sidma.htm\">SIAM J. Discrete Math<\/a>&nbsp;12: 307-316, 1999&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/edge-band.pdf\">(PDF)<\/a><\/li><li>Coloring of Trees with Minimum Sum of Colors (with D.B. West),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory<\/a>&nbsp;32: 354-358, 1999<\/li><li>Connectivity and Separating Sets of Cages (with D. Mubayi),&nbsp;<a href=\"http:\/\/www.interscience.wiley.com\/jpages\/0364-9024\/\">J. Graph Theory<\/a>&nbsp;29: 35-44, 1998&nbsp;<a href=\"http:\/\/www.users.muohio.edu\/jiangt\/publications\/cages.pdf\">(PDF)<\/a><\/li><li><a href=\"http:\/\/www.users.muohio.edu\/jiangt\/thesis.ps\">Structural and extremal problems in graph theory&nbsp;<\/a>(Ph.D. dissertation, University of Illinois, 2000. Adviser: Douglas B. West).<\/li><\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Induced rational exponents nears two (with S. Longbrake), arxiv (PDF) On the number of families avoiding a subposet (with S. Longbrake, L. Yepremyan), arxiv. (PDF) Regularization and asymmetric extremal numbers of subdivisions (with S. Longbrake), submitted. (PDF) On the number of H-free hypergraphs (with S. Longbrake), Forum of Math, Sigma , vol 14, e20, 2026. [&hellip;]<\/p>\n","protected":false},"author":5860,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"class_list":["post-12","page","type-page","status-publish","hentry"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/pages\/12","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/users\/5860"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/comments?post=12"}],"version-history":[{"count":2,"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/pages\/12\/revisions"}],"predecessor-version":[{"id":257,"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/pages\/12\/revisions\/257"}],"wp:attachment":[{"href":"https:\/\/sites.miamioh.edu\/jiangt\/wp-json\/wp\/v2\/media?parent=12"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}