On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices. - Long-Tu Yuan; Xiao-Dong Zhang 001 (Ars Math. Contemp., 2017)

The Turán number of disjoint copies of paths. - Long-Tu Yuan; Xiao-Dong Zhang 001 (Discret. Math., 2017)

A Variation of the Erdős-Sós Conjecture in Bipartite Graphs. - Long-Tu Yuan; Xiao-Dong Zhang 001 (Graphs Comb., 2017)

Extremal graphs for the k-flower. - Long-Tu Yuan (J. Graph Theory, 2018)

A note on Turán's theorem. - Long-Tu Yuan (Appl. Math. Comput., 2019)

On the anti-Ramsey numbers of linear forests. - Tian-Ying Xie; Long-Tu Yuan (Discret. Math., 2020)

The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths. - Changhong Lu; Long-Tu Yuan; Ping Zhang (Electron. J. Comb., 2021)

Extremal graphs for odd wheels. - Long-Tu Yuan (J. Graph Theory, 2021)

Turán numbers for disjoint paths. - Long-Tu Yuan; Xiao-Dong Zhang 001 (J. Graph Theory, 2021)

A note on the 2-power of Hamilton cycles. - Zia Ullah Khan; Long-Tu Yuan (Discret. Math., 2022)

Graphs with large maximum degree containing no edge-critical graphs. - Qingyi Huo; Long-Tu Yuan (Eur. J. Comb., 2022)

Extremal graphs of the pth power of paths. - Long-Tu Yuan (Eur. J. Comb., 2022)

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. - Wanfang Chen; Changhong Lu; Long-Tu Yuan (Graphs Comb., 2022)

Extremal graphs for edge blow-up of graphs. - Long-Tu Yuan (J. Comb. Theory B, 2022)

The structure of graphs with given lengths of cycles. - Cheng Chi; Long-Tu Yuan (Discret. Math., 2023)

The Turán number for the edge blow-up of trees: The missing case. - Cheng Chi; Long-Tu Yuan (Discret. Math., 2023)

Circumference, Minimum Degree and Clique Number. - Long-Tu Yuan (Electron. J. Comb., 2024)

A note on the stability results of the number of cliques in graphs with given matching number. - Jia-Bao Yang; Long-Tu Yuan (Discret. Appl. Math., 2024)

Exact generalized Turán numbers for even linear forests. - Ya-Hong Chen; Jia-Bao Yang; Long-Tu Yuan; Ping Zhang (Discret. Math., 2024)

Extremal graphs for even linear forests in bipartite graphs. - Long-Tu Yuan; Xiao-Dong Zhang (Discuss. Math. Graph Theory, 2024)

A Stability Result of the Pósa Lemma. - Jie Ma; Long-Tu Yuan (SIAM J. Discret. Math., 2024)

On the Turán Number of Edge Blow-Ups of Cliques. - Jialei Song; Changhong Lu; Long-Tu Yuan (SIAM J. Discret. Math., 2024)

Packing of the k-power of Hamilton cycles. - Wanfang Chen; Changhong Lu; Qi Wu; Long-Tu Yuan (Discret. Math., 2025)

Stability in Bondy's theorem on paths and cycles. - Bo Ning; Long-Tu Yuan (J. Comb. Theory B, 2025)

Supersaturation Beyond Color-Critical Graphs. - Jie Ma; Long-Tu Yuan (Comb., 2025)