5 citations · 18 across the 23 of their papers we have counts for
4 papers · 1 filter
A stability theorem for multi-partite graphs
Wanfang Chen, Changhong Lu, Long-Tu Yuan
The Erdős-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erdős-Simonovits type stability theorem in multi-partite graph…
Stability in Bondy's theorem on paths and cycles
Bo Ning, Long-tu Yuan
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one verte…
The Turán number for the edge blow-up of trees: the missing case
Cheng Chi, Long-Tu Yuan
The edge blow-up of a graph is the graph obtained from replacing each edge of it by a clique of the same size where the new vertices of the cliques are all different. Wang, Hou, Li…
The bipartite Turan number and spectral extremum for linear forests
Ming-Zhu Chen, Ning Wang, Long-Tu Yuan +1
The bipartite Turán number of a graph , denoted by , is the maximum number of edges in any bipartite graph with and which does not conta…