I am a "Thousand Youth Talents Program" Professor (“青年千人计划”教授) at the School of Mathematical Sciences, University of Science and Technology of China (USTC).

I was a Hedrick Assistant Professor at the Department of Mathematics, UCLA, and a Postdoctoral Associate at the Department of Mathematical Sciences, Carnegie Mellon University. I obtained my Ph.D. degree in 2011 from the School of Mathematics, Georgia Institute of Technology, under the supervision of Prof. Xingxing Yu. Back in 2007, I recieved my B.S. degree from the School of Mathematical Sciences, USTC. For more information please see my Curriculum Vitae as below.

** Email address**: jiema (at) ustc.edu.cn

** Research Interests**:

**Curriculum Vitae:** CV

**Publications:**

- Independent paths and K_5-subdivisions (with X. Yu), J. Combin. Theory, Ser. B 100(6) (2010), 600-616.
- On several partition problems of Bollobas and Scott (with P. Yan, X.Yu), J. Combin. Theory, Ser. B 100(6) (2010), 631-649.
- Bounds for pairs in partitions of graphs (with X. Yu), Discrete Mathematics 310(15-16) (2010), 2069-2081.
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (with M.Bilinski, B.Jackson, X. Yu), J. Combin. Theory, Ser. B 101(4) (2011), 214-236.
- A note on Lovasz removable path conjecture, Journal of Combinatorics 2(1) (2011),103-109.
- Partitioning 3-uniform hypergraphs (with X. Yu), J. Combin. Theory, Ser. B 102(1) (2012), 212-232.
- A problem of Erdos on the minimum number of k-cliques (with S. Das, H. Huang, H. Naves and B. Sudakov), J. Combin. Theory, Ser. B 103(3) (2013), 344-373.
- Approximate min-max relations on plane graphs (with X. Yu, W. Zang), Journal of Combinatorial Optimization 26(1) (2013), 127-134.
- Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs (with H. Huang, A. Shapira, B. Sudakov and R. Yuster), Combinatorics, Probability and Computing 22(6) (2013), 859-873.
- K_5-subdivisions in graphs containing K_4^{-} (with X. Yu), J. Combin. Theory, Ser. B 103(6) (2013), 713-732.
- Longest common subsequences in sets of words (with B. Bukh), SIAM J. Discrete Math 28(4) (2014), 2042–2049.
- K_5-subdivisions in graphs containing K_{2,3}(with K. Kawarabayashi, X. Yu), J. Combin. Theory, Ser. B 113 (2015), 18-67.
- Discrepancy of random graphs and hypergraphs (with H. Naves and B. Sudakov), Random Structure and Algorithms 47(1) (2015), 147-162. Journal Version
- Coloring digraphs with forbidden cycles (with Z. Chen and W. Zang), J. Combin. Theory, Ser. B 115 (2015), 210-223. Journal Version
- Maximizing proper colorings on graphs (with H. Naves), J. Combin. Theory, Ser. B 115 (2015), 236-275 . Journal Version
- Graphs containing topological H (with Q. Xie and X. Yu), J. Graph Theory 82(2) (2016),121-153. Journal Version
- On Judicious bipartitions of graphs (with X. Yu), Combinatorica 36 (2016), 537-556. Journal Version
- Cycles with consecutive odd lengths, European Journal of Combinatorics 52 (2016), 74-78. Journal Version
- Diameter critical graphs (with P. Loh), J. Combin. Theory, Ser. B 117 (2016), 34-58. Journal Version
- On edges not in monochromatic copies of a fixed bipartite graph, J. Combin. Theory, Ser. B 123 (2017), 240–248. Journal Version
- Cycle lengths and minimum degree of graphs (with C. Liu), J. Combin. Theory, Ser. B, to appear. Journal Version
- Coloring graphs with two odd cycle lengths (with B. Ning), SIAM J. Discrete Math, to appear.
- Cycles with two blocks in k-chromatic digraphs (with R. Kim, S. Kim and B.Park), J. Graph Theory, to appear.
- Some extremal results on complete degenerate hypergraphs (with X. Yuan and M. Zhang), J. Combin. Theory, Ser. A 154 (2018), 598-609. Journal Version
- Cycles of given lengths in hypergraphs (with T. Jiang), Submitted.
- On problems about judicious bipartitions of graphs (with Y. Ji, J. Yan and X. Yu), Submitted.
- Decomposing C4-free graphs under degree constraints (with T. Yang), Submitted.
- Stability results on the circumference of a graph (with B. Ning), Submitted.

** Teaching:**

**Some useful links**: