Bounds for pairs in partitions of graphs. - Jie Ma 002; Xingxing Yu (Discret. Math., 2010)

Independent paths and K5-subdivisions. - Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2010)

On several partitioning problems of Bollobás and Scott. - Jie Ma 002; Pei-Lan Yen; Xingxing Yu (J. Comb. Theory B, 2010)

Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. - Mark Bilinski; Bill Jackson; Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2011)

Partitioning 3-uniform hypergraphs. - Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2012)

Approximate min-max relations on plane graphs. - Jie Ma 002; Xingxing Yu; Wenan Zang (J. Comb. Optim., 2013)

K5-Subdivisions in graphs containing K-4. - Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2013)

Coloring digraphs with forbidden cycles. - Zhibin Chen; Jie Ma 002; Wenan Zang (J. Comb. Theory B, 2015)

Subdivisions of K5 in graphs containing K2, 3. - Ken-ichi Kawarabayashi; Jie Ma 002; Xingxing Yu (J. Comb. Theory B, 2015)

Maximizing proper colorings on graphs. - Jie Ma 002; Humberto Naves (J. Comb. Theory B, 2015)

On judicious bipartitions of graphs. - Jie Ma 002; Xingxing Yu (Comb., 2016)

Cycles with consecutive odd lengths. - Jie Ma 002 (Eur. J. Comb., 2016)

Diameter critical graphs. - Po-Shen Loh; Jie Ma 002 (J. Comb. Theory B, 2016)

Graphs Containing Topological H. - Jie Ma 002; Qiqin Xie; Xingxing Yu (J. Graph Theory, 2016)

On edges not in monochromatic copies of a fixed bipartite graph. - Jie Ma 002 (J. Comb. Theory B, 2017)

Cycles of given lengths in hypergraphs. - Tao Jiang 003; Jie Ma 002 (J. Comb. Theory B, 2018)

Cycle lengths and minimum degree of graphs. - Chun-Hung Liu; Jie Ma 002 (J. Comb. Theory B, 2018)

Some extremal results on complete degenerate hypergraphs. - Jie Ma 002; Xiaofan Yuan; Mingwei Zhang (J. Comb. Theory A, 2018)

Cycles with two blocks in k-chromatic digraphs. - Ringi Kim; Seog-Jin Kim; Jie Ma 002; Boram Park (J. Graph Theory, 2018)

On problems about judicious bipartitions of graphs. - Yuliang Ji; Jie Ma 002; Juan Yan; Xingxing Yu (J. Comb. Theory B, 2019)

Decomposing C4-free graphs under degree constraints. - Jie Ma 002; Tianchi Yang (J. Graph Theory, 2019)

Stability Results on the Circumference of a Graph. - Jie Ma 002; Bo Ning 001 (Comb., 2020)

Monochromatic Subgraphs in Iterated Triangulations. - Jie Ma 002; Tianyun Tang; Xingxing Yu (Electron. J. Comb., 2020)

Some sharp results on the generalized Turán numbers. - Jie Ma 002; Yu Qiu (Eur. J. Comb., 2020)

On a conjecture of Bondy and Vince. - Jun Gao 002; Jie Ma 002 (J. Comb. Theory B, 2020)

A Conjecture of Verstraëte on Vertex-Disjoint Cycles. - Jun Gao 002; Jie Ma 002 (SIAM J. Discret. Math., 2020)

Counting Critical Subgraphs in k-Critical Graphs. - Jie Ma 002; Tianchi Yang (Comb., 2021)

Some extremal results on 4-cycles. - Jialin He; Jie Ma 002; Tianchi Yang (J. Comb. Theory B, 2021)

A Strengthening on Odd Cycles in Graphs of Given Chromatic Number. - Jun Gao 002; Qingyi Huo; Jie Ma 002 (SIAM J. Discret. Math., 2021)

Minimizing cycles in tournaments and normalized (q )-norms. - Jie Ma 002; Tianyun Tang (Comb. Theory, 2022)

On Turán exponents of bipartite graphs. - Tao Jiang 003; Jie Ma 002; Liana Yepremyan (Comb. Probab. Comput., 2022)

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles. - Binlong Li; Jie Ma 002; Bo Ning 001 (J. Comb. Theory B, 2022)

Sparse halves in K 4 -free graphs. - Xizhi Liu; Jie Ma 002 (J. Graph Theory, 2022)

Bipartite-ness under smooth conditions. - Tao Jiang 003; Sean Longbrake; Jie Ma 002 (Comb. Probab. Comput., 2023)

The minimum number of clique-saturating edges. - Jialin He; Fuhong Ma; Jie Ma 002; Xinyang Ye (J. Comb. Theory B, 2023)

Towards a conjecture of Birmelé-Bondy-Reed on the Erdős-Pósa property of long cycles. - Jie Ma 002; Chunlei Zu (J. Graph Theory, 2023)

Tight Bounds Towards a Conjecture of Gallai. - Jun Gao 002; Jie Ma 002 (Comb., 2023)

On the maximum number of edges in -critical graphs. - Cong Luo; Jie Ma 002; Tianchi Yang (Comb. Probab. Comput., 2023)

Linear cycles of consecutive lengths. - Tao Jiang 003; Jie Ma 002; Liana Yepremyan (J. Comb. Theory B, 2023)

On two cycles of consecutive even lengths. - Jun Gao 002; Binlong Li; Jie Ma 002; Tianying Xie (J. Graph Theory, 2024)

Counting triangles in regular graphs. - Jialin He; Xinmin Hou; Jie Ma 002; Tianying Xie (J. Graph Theory, 2024)

Partitioning graphs with linear minimum degree. - Jie Ma 002; Hehui Wu (Random Struct. Algorithms, 2024)

Optimal bisections of directed graphs. - Guanwu Liu; Jie Ma 002; Chunlei Zu (Random Struct. Algorithms, 2024)

On two problems of defective choosability of graphs. - Jie Ma 002; Rongxing Xu; Xuding Zhu (J. Graph Theory, 2025)