个人信息Personal Information
教授
电子邮箱：
联系方式：0551-63600625
学位：博士
- On edges not in monochromatic copies of a fixed bipartite graph, Jie Ma, J. Combin. Theory, Ser. B 123 (2017), 240–248.
- Cycle lengths and minimum degree of graphs, Chun-Hung Liu and Jie Ma, J. Combin. Theory, Ser. B 128 (2018), 66-95.
- Coloring graphs with two odd cycle lengths, Jie Ma and Bo Ning, SIAM J. Discrete Math 32(1) (2018), 296-319.
- 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.
- Cycles of given lengths in hypergraphs, Tao Jiang and Jie Ma, J. Combin. Theory, Ser. B 133 (2018), 54-77.
- Decomposing C4-free graphs under degree constraints, Jie Ma and Tianchi Yang, J. Graph Theory 90 (2019), 13-23.
- On tight cycles in hypergraphs, Hao Huang and Jie Ma, SIAM J. Discrete Math 33(1) (2019), 230-237.
- 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.
- On a conjecture of Bondy and Vince, Jun Gao and Jie Ma, J. Combin. Theory, Ser. B 141 (2020), 136-142.
- Some sharp results on the generalized Turan numbers, Jie Ma and Yu Qiu, European J. Combin. 84 (2020), 103026.
- Stability results on the circumference of a graph, Jie Ma and Bo Ning, Combinatorica 40 (2020), 105-147.
- A conjecture of Verstraete on vertex-disjoint cycles, Jun Gao and Jie Ma, SIAM J. Discrete Math 34(2) (2020), 1290–1301.
- Some extremal results on 4-cycles, Jialin He, Jie Ma and Tianchi Yang, J. Combin. Theory, Ser. B 149 (2021), 92-108.
- A unified proof of conjectures on cycle lengths in graphs, Jun Gao, Qingyi Huo, Chun-Hung Liu and Jie Ma, Int. Math. Res. Not., to appear.
- Counting critical subgraphs in k-critical graphs, Jie Ma and Tianchi Yang, Combinatorica, to appear. Journal Version.