1 citations · 2 across the 5 of their papers we have counts for
5 papers
Spectral radius and the 2-power of Hamilton paths
Te Pi, Rui Sun, Long-Tu Yuan
We determine the maximum number of a graph without containing the 2-power of a Hamilton path. Using this result, we establish a spectral condition for a graph containing the 2-powe…
Supersaturation beyond color-critical graphs
Jie Ma, Long-Tu Yuan
The supersaturation problem for a given graph asks for the minimum number of copies of in an -vertex graph with edges. Subsequent works by Rademac…
A step towards a general density Corrádi--Hajnal Theorem
Jianfeng Hou, Heng Li, Xizhi Liu +2
For a nondegenerate -graph , large , and in the regime , where is a constant depending only on , we present a general approach for determining…
Turán numbers for disjoint paths
Long-Tu Yuan, Xiao-Dong Zhang
The Turán number of a graph , , is the maximum number of edges in any graph of order which does not contain as a subgraph. Lidický, Liu and Palmer determined $e…
On the Erdos-Sos Conjecture for Graphs on n=k+4 Vertices
Long-Tu Yuan, Xiao-Dong Zhang
The Erdős-Sós Conjecture states that if is a simple graph of order with average degree more than then contains every tree of order . In this paper, we prove t…