个人信息Personal Information
教授
电子邮箱：
联系方式：0551-63600625
学位：博士
- Independent paths and K_5-subdivisions, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 100(6) (2010), 600-616.
- 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.
- Bounds for pairs in partitions of graphs, Jie Ma and Xingxing 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, Mark Bilinski, Bill Jackson, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 101(4) (2011), 214-236.
- A note on Lovasz removable path conjecture, Jie Ma, Journal of Combinatorics 2(1) (2011),103-109.
- Partitioning 3-uniform hypergraphs, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 102(1) (2012), 212-232.
- 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.
- Approximate min-max relations on plane graphs, Jie Ma, Xingxing Yu and Wenan Zang, Journal of Combinatorial Optimization 26(1) (2013), 127-134.
- 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.
- K_5-subdivisions in graphs containing K_4^{-}, Jie Ma and Xingxing Yu, J. Combin. Theory, Ser. B 103(6) (2013), 713-732.
- Longest common subsequences in sets of words, Boris Bukh and Jie Ma, SIAM J. Discrete Math 28(4) (2014), 2042–2049.
- 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.
- Discrepancy of random graphs and hypergraphs, Jie Ma, Humberto Naves and Benny Sudakov, Random Structures & Algorithms 47(1) (2015), 147-162.
- Coloring digraphs with forbidden cycles, Zhibin Chen, Jie Ma and Wenan Zang, J. Combin. Theory, Ser. B 115 (2015), 210-223.
- Diameter critical graphs, Po-Shen Loh and Jie Ma, J. Combin. Theory, Ser. B 117 (2016), 34-58.