5 citations · 9 across the 5 of their papers we have counts for
8 papers
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…
Anti-Ramsey numbers for paths
Long-Tu Yuan
We determine the anti-Ramsey numbers for paths. This confirms a conjecture posed by Erdős, Simonovits and Sós in 1970s.
A clique version of the Erdős-Gallai stability theorems
Jie Ma, Long-Tu Yuan
Combining Pósa's rotation lemma with a technique of Kopylov in a novel approach, we prove a generalization of the Erdős-Gallai theorems on cycles and paths. This implies a clique v…
Extremal graphs of the -th power of paths
Long-Tu Yuan
An extremal graph for a given graph is a graph with maximum number of edges on fixed number of vertices without containing a copy of . The -th power of a path is a graph…
On the anti-Ramsey numbers of linear forests
Tian-Ying Xie, Long-Tu Yuan
For a fixed graph , the , , is the maximum number of colors in an edge-coloring of which does not contain a rainbow copy of . In t…
Extremal graphs for edge blow-up of graphs
Long-Tu Yuan
Given a graph and an integer , the {\it edge blow-up} of , denoted as , is the graph obtained from replacing each edge in by a clique of size where the…