Long-Tu Yuan

28 papers Journal 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two.
Discret. Math.
Zhipeng Gao, Ping Li, Changhong Lu, Rui Sun, Long-Tu Yuan
2025 J jnl
A stability theorem for multi-partite graphs.
Comb. Probab. Comput.
Wanfang Chen, Changhong Lu, Long-Tu Yuan
2025 J jnl
Packing of the k-power of Hamilton cycles.
Discret. Math.
Wanfang Chen, Changhong Lu, Qi Wu, Long-Tu Yuan
2025 J jnl
Proof of a conjecture of Xiao and Zamora.
Graphs Comb.
Wanfang Chen, Changhong Lu, Jia-Bao Yang, Long-Tu Yuan
2025 J jnl
Stability in Bondy's theorem on paths and cycles.
J. Comb. Theory B
Bo Ning, Long-Tu Yuan
2025 J jnl
Supersaturation Beyond Color-Critical Graphs.
Comb.
Jie Ma, Long-Tu Yuan
2024 J jnl
A Stability Result of the Pósa Lemma.
SIAM J. Discret. Math.
Jie Ma, Long-Tu Yuan
2024 J jnl
A note on the stability results of the number of cliques in graphs with given matching number.
Discret. Appl. Math.
Jia-Bao Yang, Long-Tu Yuan
2024 J jnl
Circumference, Minimum Degree and Clique Number.
Electron. J. Comb.
Long-Tu Yuan
2024 J jnl
Exact generalized Turán numbers for even linear forests.
Discret. Math.
Ya-Hong Chen, Jia-Bao Yang, Long-Tu Yuan, Ping Zhang
2024 J jnl
Extremal graphs for even linear forests in bipartite graphs.
Discuss. Math. Graph Theory
Long-Tu Yuan, Xiao-Dong Zhang
2024 J jnl
On the Turán Number of Edge Blow-Ups of Cliques.
SIAM J. Discret. Math.
Jialei Song, Changhong Lu, Long-Tu Yuan
2023 J jnl
The Turán number for the edge blow-up of trees: The missing case.
Discret. Math.
Cheng Chi, Long-Tu Yuan
2023 J jnl
The structure of graphs with given lengths of cycles.
Discret. Math.
Cheng Chi, Long-Tu Yuan
2022 J jnl
A note on the 2-power of Hamilton cycles.
Discret. Math.
Zia Ullah Khan, Long-Tu Yuan
2022 J jnl
Extremal Graphs for Two Vertex-Disjoint Copies of a Clique.
Graphs Comb.
Wanfang Chen, Changhong Lu, Long-Tu Yuan
2022 J jnl
Extremal graphs for edge blow-up of graphs.
J. Comb. Theory B
Long-Tu Yuan
2022 J jnl
Extremal graphs of the pth power of paths.
Eur. J. Comb.
Long-Tu Yuan
2022 J jnl
Graphs with large maximum degree containing no edge-critical graphs.
Eur. J. Comb.
Qingyi Huo, Long-Tu Yuan
2021 J jnl
Extremal graphs for odd wheels.
J. Graph Theory
Long-Tu Yuan
2021 J jnl
The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths.
Electron. J. Comb.
Changhong Lu, Long-Tu Yuan, Ping Zhang
2021 J jnl
Turán numbers for disjoint paths.
J. Graph Theory
Long-Tu Yuan, Xiao-Dong Zhang
2020 J jnl
On the anti-Ramsey numbers of linear forests.
Discret. Math.
Tian-Ying Xie, Long-Tu Yuan
2019 J jnl
A note on Turán's theorem.
Appl. Math. Comput.
Long-Tu Yuan
2018 J jnl
Extremal graphs for the k-flower.
J. Graph Theory
Long-Tu Yuan
2017 J jnl
A Variation of the Erdős-Sós Conjecture in Bipartite Graphs.
Graphs Comb.
Long-Tu Yuan, Xiao-Dong Zhang
2017 J jnl
On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices.
Ars Math. Contemp.
Long-Tu Yuan, Xiao-Dong Zhang
2017 J jnl
The Turán number of disjoint copies of paths.
Discret. Math.
Long-Tu Yuan, Xiao-Dong Zhang