Welcome to Jie Ma's Home Page

Ma (马), Jie (杰)

I am a 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.

I am an associate editor at SIAM Journal on Discrete Mathematics since 2018. I received The National Science Fund for Excellent Young Scholars (国家自然科学基金委优秀青年基金) in 2016 and The National Science Fund for Distinguished Young Scholars (国家自然科学基金委杰出青年基金) in 2021.


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

Research Interests:

Extremal Combinatorics, Graph Theory, Probabilistic Methods in Combinatorics, and their applications to theoretical Computer Science and Optimization

Curriculum Vitae: CV

Publication:

  1. Independent paths and K_5-subdivisions, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 100(6) (2010), 600-616. Journal Version
  2. On several partition problems of Bollobas and Scott, Jie Ma, Pei-Lan Yen and Xingxing Yu, J. Combin. Theory, Ser. B 100(6) (2010), 631-649. Journal Version
  3. Bounds for pairs in partitions of graphs, Jie Ma and Xingxing Yu, Discrete Mathematics 310(15-16) (2010), 2069-2081. Journal Version
  4. Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs, Mark Bilinski, Bill Jackson, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 101(4) (2011), 214-236. Journal Version
  5. A note on Lovasz removable path conjecture, Jie Ma, Journal of Combinatorics 2(1) (2011),103-109. Journal Version
  6. Partitioning 3-uniform hypergraphs, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 102(1) (2012), 212-232. Journal Version
  7. A problem of Erdos on the minimum number of k-cliques, Shagnik Das, Hao Huang, Jie Ma, Humberto Naves and Benny Sudakov, J. Combin. Theory, Ser. B 103(3) (2013), 344-373. Journal Version
  8. Approximate min-max relations on plane graphs, Jie Ma, Xingxing Yu and Wenan Zang, Journal of Combinatorial Optimization 26(1) (2013), 127-134. Journal Version
  9. Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs , Hao Huang, Jie Ma, Asaf Shapira, Benny Sudakov and Raphael Yuster, Combinatorics, Probability and Computing 22(6) (2013), 859-873. Journal Version
  10. K_5-subdivisions in graphs containing K_4^{-}, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 103(6) (2013), 713-732. Journal Version
  11. Longest common subsequences in sets of words, Boris Bukh and Jie Ma, SIAM J. Discrete Math. 28(4) (2014), 2042–2049. Journal Version
  12. Subdivisions of K5 in graphs containing K_{2,3}, Ken-ichi Kawarabayashi, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 113 (2015), 18-67. Journal Version
  13. Discrepancy of random graphs and hypergraphs, Jie Ma, Humberto Naves and Benny Sudakov, Random Structures & Algorithms 47(1) (2015), 147-162. Journal Version
  14. Coloring digraphs with forbidden cycles, Zhibin Chen, Jie Ma and Wenan Zang, J. Combin. Theory, Ser. B 115 (2015), 210-223. Journal Version
  15. Maximizing proper colorings on graphs, Jie Ma and Humberto Naves, J. Combin. Theory, Ser. B 115 (2015), 236-275 . Journal Version
  16. Graphs containing topological H, Jie Ma, Qiqin Xie and Xingxing Yu, J. Graph Theory 82(2) (2016),121-153. Journal Version
  17. On Judicious bipartitions of graphs, Jie Ma and Xingxing Yu, Combinatorica 36 (2016), 537-556. Journal Version
  18. Cycles with consecutive odd lengths, Jie Ma, European J. Combin. 52 (2016), 74-78. Journal Version
  19. Diameter critical graphs, Po-Shen Loh and Jie Ma, J. Combin. Theory, Ser. B 117 (2016), 34-58. Journal Version
  20. On edges not in monochromatic copies of a fixed bipartite graph, Jie Ma, J. Combin. Theory, Ser. B 123 (2017), 240–248. Journal Version
  21. Some extremal results on complete degenerate hypergraphs, Jie Ma, Xiaofan Yuan and Mingwei Zhang, J. Combin. Theory, Ser. A 154 (2018), 598-609. Journal Version
  22. Cycle lengths and minimum degree of graphs, Chun-Hung Liu and Jie Ma, J. Combin. Theory, Ser. B 128 (2018), 66-95. Journal Version
  23. Coloring graphs with two odd cycle lengths, Jie Ma and Bo Ning, SIAM J. Discrete Math. 32(1) (2018), 296-319. Journal Version
  24. Cycles with two blocks in k-chromatic digraphs, Ringi Kim, Seog-Jin Kim, Jie Ma and Boram Park, J. Graph Theory 88 (2018), 592-605. Journal Version
  25. Cycles of given lengths in hypergraphs, Tao Jiang and Jie Ma, J. Combin. Theory, Ser. B 133 (2018), 54-77. Journal Version
  26. Decomposing C4-free graphs under degree constraints, Jie Ma and Tianchi Yang, J. Graph Theory 90 (2019), 13-23. Journal Version
  27. On tight cycles in hypergraphs, Hao Huang and Jie Ma, SIAM J. Discrete Math. 33(1) (2019), 230-237. Journal Version
  28. On problems about judicious bipartitions of graphs, Yuliang Ji, Jie Ma, Juan Yan and Xingxing Yu, J. Combin. Theory, Ser. B 139 (2019), 230-250. Journal Version
  29. On a conjecture of Bondy and Vince, Jun Gao and Jie Ma, J. Combin. Theory, Ser. B 141 (2020), 136-142. Journal Version
  30. Some sharp results on the generalized Turan numbers, Jie Ma and Yu Qiu, European J. Combin. 84 (2020), 103026. Journal Version
  31. Stability results on the circumference of a graph, Jie Ma and Bo Ning, Combinatorica 40 (2020), 105-147. Journal Version
  32. A conjecture of Verstraete on vertex-disjoint cycles, Jun Gao and Jie Ma, SIAM J. Discrete Math. 34(2) (2020), 1290–1301. Journal Version
  33. Monochromatic subgraphs in iterated triangulations, Jie Ma, Tianyun Tang and Xingxing Yu, Electron. J. Combin. 27(4) (2020), P4.18. Journal Version
  34. Some extremal results on 4-cycles, Jialin He, Jie Ma and Tianchi Yang, J. Combin. Theory, Ser. B 149 (2021), 92-108. Journal Version
  35. A strengthening on odd cycles in graphs of given chromatic number, Jun Gao, Qingyi Huo and Jie Ma, SIAM J. Discrete Math. 35(4) (2021), 2317–2327. Journal Version
  36. Counting critical subgraphs in k-critical graphs, Jie Ma and Tianchi Yang, Combinatorica 41 (2021), 669–694. Journal Version
  37. Non-repeated cycle lengths and Sidon sequences, Jie Ma and Tianchi Yang, Israel Journal of Mathematics 245 (2021), 639–674. Journal Version
  38. Extremal problems of Erdos, Faudree, Schelp and Simonovits on paths and cycles, Binlong Li, Jie Ma and Bo Ning, J. Combin. Theory, Ser. B 152 (2022), 399-414. Journal Version
  39. Sparse halves in K4-free graphs, Xizhi Liu and Jie Ma, J. Graph Theory 99(1) (2022), 5-25. Journal Version
  40. On Turan exponents of bipartite graphs, Tao Jiang, Jie Ma and Liana Yepremyan, Combinatorics, Probability and Computing 31(2) (2022), 333-344. Journal Version
  41. A unified proof of conjectures on cycle lengths in graphs, Jun Gao, Qingyi Huo, Chun-Hung Liu and Jie Ma, Int. Math. Res. Not. 2022(10) (2022), 7615-7653. Journal Version
  42. On the rainbow matching conjecture for 3-uniform hypergraphs, Jun Gao, Hongliang Lu, Jie Ma and Xingxing Yu, Science China Mathematics 65 (2022), 2423-2440. Journal Version
  43. Negligible obstructions and Turan exponents, Tao Jiang, Zilin Jiang and Jie Ma, Annals of Applied Mathematics 38(3) (2022), 356-384. Journal Version
  44. Minimizing cycles in tournaments and normalized q-norms, Jie Ma and Tianyun Tang, Combinatorial Theory 2(3) (2022), #6. Journal Version
  45. Some exact results on 4-cycles: stability and supersaturation, Jialin He, Jie Ma and Tianchi Yang, CSIAM Transactions on Applied Mathematics, to appear.
  46. Tight bounds towards a conjecture of Gallai, Jun Gao and Jie Ma, Combinatorica, to appear.
  47. Towards a conjecture of Birmele-Bondy-Reed on the Erdos-Posa property of long cycles, Jie Ma and Chunlei Zu, J. Graph Theory, to appear.
  48. The minimum number of clique-saturating edges, Jialin He, Fuhong Ma, Jie Ma and Xinyang Ye, J. Combin. Theory, Ser. B, to appear.
  49. Linear cycles of consecutive lengths, Tao Jiang, Jie Ma and Liana Yepremyan, Submitted.
  50. The inducibility of oriented stars, Ping Hu, Jie Ma, Sergey Norin and Hehui Wu, Submitted.
  51. A clique version of the Erdos-Gallai stability theorems, Jie Ma and Long-Tu Yuan, Submitted.
  52. Improvements on induced subgraphs of given sizes, Jialin He, Jie Ma and Lilu Zhao, Submitted.
  53. Upper bounds on the extremal number of the 4-cycle, Jie Ma and Tianchi Yang, Submitted.
  54. Bipartite-ness under smooth conditions, Tao Jiang, Sean Longbrake and Jie Ma, Submitted.
  55. A note on extremal numbers of the triangle plus the four-cycle, Jie Ma and Tianchi Yang, Submitted.
  56. A non-uniform extension of Baranyai's Theorem, Jinye He, Hao Huang and Jie Ma, Submitted.
  57. On two cycles of consecutive even lengths, Jun Gao, Binlong Li, Jie Ma and Tianying Xie, Submitted.

Teaching:

2021 Spring [Extremal Combinatorics]

2020 Fall [Combinatorics]

2020 Spring [Extremal and Probabilistic Graph Theory]

2017 Spring [Extremal and Probabilistic Graph Theory]

2016 Fall [Combinatorics]

2016 Spring [Extremal and Probabilistic Graph Theory]

2015 Fall [Combinatorics]

2015 Spring [Combinatorial Networks]

Association:

  • Chinese Mathematical Society, China Society for Combinatorics and Graph Theory (CSCGT)
  • China Society for Industrial and Applied Mathematics (CSIAM), Activity Group on Graph Theory and Combinatorics with Applications
  • Operations Research Society of China (ORSC), Branch on Graph Theory and Combinatoric
  • Some useful links:

  • Recent Submissions of Combinatorics at arXiv
  • Coming Combinatorial Conferences from the home page of Prof. Douglas B. West
  • MathSciNet - American Mathematical Society
  • Google Scholar and Scopus
  • Open Problem Garden
  • Erdos' Problems on Graphs from UCSD
  • Wolframalpha
  • Online Matrix Calculator

  • 欢迎报考或联系科大的研究生、博士生和博士后, 对图论组合感兴趣的同学请邮件联系(敬请附上个人简历)

  • Number of visits since Jan 2015: