马杰



电  话:86-551-63600625

E-Mail:jiema@ustc.edu.cn 

个人主页:http://staff.ustc.edu.cn/~jiema/ 


主要研究方向:极值组合、图论、组合数学中的概率方法、理论在计算科学与优化中的应用


马杰,中国科学技术大学数学科学学院教授。2007年在中国科学技术大学数学科学学院获得学士学位,2011年在佐治亚理工学院获得博士学位。曾在卡内基梅隆大学数据科学学院担任博士后研究员,在加利福利亚洛杉矶分校数学学院担任Hedrick助理教授。2016年获得国家自然科学基金委优秀青年基金。2018年起担任SIAM期刊离散数学版块(SIAM Journal on Discrete Mathematics)的副编辑。


获奖情况:

1. 2018年中国工业与应用数学学会应用数学青年科技奖

2. 2018年霍英东教育基金会第十六届高等院校青年教师奖

3. 2017年安徽省青年数学奖

4. AMS-SimonsTravel Grants, 2012-2013.


主持或参加的科研项目:

1. 国家自然科学基金优秀青年科学基金项目,11622110,极值图论,2017.01-2019.12,在研,主持

2. 国家自然科学基金青年科学基金项目,11501539,图分割和标志代数,2016.01-2018.12,已结题,主持


主要论著:

[1] Independent paths and K5-subdivisions, J. Ma and X. Yu, J. Comb. Theory, Ser. B 100(6) (2010), 600-616

[2] On several partitioning problems of Bollobás and Scott, J. Ma, P. Yan and X. Yu, J. Comb. Theory, Ser. B 100(6) (2010), 631-649

[3] Bounds for pairs in partitions of graphs, J. Ma and X. Yu, Discrete Mathematics 310(15-16) (2010), 2069-2081

[4] Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge- connected graphs, M. Bilinski, B. Jackson, J. Ma and X. Yu, J. Comb. Theory, Ser. B 101(4) (2011), 214-236

[5] A note on Lovász removable path conjecture, Journal of Combinatorics 2(1) (2011), 103-109

[6] Partitioning 3-uniform hypergraphs, J. Ma and X. Yu, J. Comb. Theory, Ser. B 102(1) (2012), 212-232

[7] A problem of Erdös on the minimum number of k-cliques, S. Das, H. Huang, J. Ma, H. Naves and B. Sudakov, J. Comb. Theory, Ser. B 103(3) (2013), 344-373

[8] Approximate min-max relations on plane graphs, J. Ma, X. Yu and W. Zang, J. Combinatorial Optimization 26(1) (2013), 127-134

[9] Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs, H. Huang, J. Ma, A. Shapira, B. Sudakov and R. Yuster, Combinatorics, Probability and Computing 22(6) (2013), 859-873

[10] K5-subdivisions in graphs containing K4-, J. Ma and X. Yu, J. Comb. Theory, Ser. B 103(6) (2013), 713-732

[11] Longest common subsequences in sets of words, B. Bukh and J, Ma, SIAM J. Discrete Math 28(4) (2014), 2042–2049 

[12] Subdivisionsof K5 in graphs containing K_{2,3}(with K. Kawarabayashi, X. Yu), J. Combin.Theory, Ser. B 113 (2015), 18-67.

[13] Discrepancy of random graphs and hypergraphs, J. Ma, H. Naves and B. Sudakov, Random Structure and Algorithms 47(1) (2015), 147-162

[14] Coloring digraphs with forbidden cycles, Z. Chen, J. Ma and W. Zang, J. Combin. Theory, Ser. B 115 (2015), 210-223

[15] Maximizing proper colorings on graphs, J. Ma and H. Naves, J. Combin. Theory, Ser. B 115 (2015), 236-275

[16] Graphs containing topological H, J. Ma, Q. Xie and X. Yu, J. Graph Theory 82(2) (2016),121-153.

[17] On Judicious bipartitions of graphs, J. Ma and X. Yu, Combinatorica, 36 (2016), 537-556.

[18] Cycles with consecutive odd lengths, J. Ma, European Journal of Combinatorics 52 (2016), 74-78.

[19] Diameter critical graphs, P. Loh and J. Ma, J. Combin. Theory, Ser. B 117 (2016), 34-58.

[20] On edges not in monochromatic copies of a fixed bipartite graph, J. Ma, J. Combin. Theory, Ser. B 123 (2017), 240–248

[21] Someextremal results on complete degenerate hypergraphs (with X. Yuan and M.Zhang), J. Combin. Theory, Ser. A 154 (2018), 598-609.

[22] Cyclelengths and minimum degree of graphs (with C. Liu), J. Combin. Theory, Ser. B128 (2018), 66-95.

[23] Coloringgraphs with two odd cycle lengths (with B. Ning), SIAM J. Discrete Math 32(1)(2018), 296-319.

[24] Cycleswith two blocks in k-chromatic digraphs (with R. Kim, S. Kim and B. Park), J.Graph Theory 88 (2018), 592-605.

[25] Cyclesof given lengths in hypergraphs (with T. Jiang), J. Combin. Theory, Ser. B 133(2018), 54-77.

[26] DecomposingC4-free graphs under degree constraints (with T. Yang), J. Graph Theory 90(2019), 13-23.

[27] Ontight cycles in hypergraphs (with H. Huang), SIAM J. Discrete Math 33(1)(2019), 230-237.

[28] Onproblems about judicious bipartitions of graphs (with Y. Ji, J. Yan and X. Yu),J. Combin. Theory, Ser. B 139 (2019), 230-250.

[29] Stabilityresults on the circumference of a graph (with B. Ning), Combinatorica, toappear.

[30] Ona conjecture of Bondy and Vince (with J. Gao), J. Combin. Theory, Ser. B, toappear.

[31] Somesharp results on the generalized Turan numbers (with Y. Qiu), European J.Combin. 84 (2020), 103026.

[32] OnTuran exponents of some bipartite graphs (with T. Jiang and L. Yepremyan),Submitted.

[33] Aunified proof of conjectures on cycle lengths in graphs (with J. Gao, Q. Huoand C. Liu), Submitted.

[34] Aconjecture of Verstraete on vertex-disjoint cycles (with J. Gao), Submitted.

[35] Countingcritical subgraphs in k-critical graphs (with T. Yang), Submitted.