66 citations · 268 across the 69 of their papers we have counts for
7 papers · 1 filter
A Turán-type problem on distance two
Xueliang Li, Jing Ma, Yongtang Shi +1
A new turán-type problem on distances on graphs was introduced by Tyomkyn and Uzzell. In this paper, we focus on the case that the distance is two. We primely show that for any val…
Non-jumping Numbers for 5-Uniform Hypergraphs
Ran Gu, Xueliang Li, Zhongmei Qin +2
Let and be integers. A real number is a jump for if for any and any integer , any -uniform graph with $n > n_0(\varep…
Some Motzkin-Straus type results for non-uniform hypergraphs
Ran Gu, Xueliang Li, Yuejian Peng +1
A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extensions were a…
Hypergraph Turán numbers of vertex disjoint cycles
Ran Gu, Xueliang Li, Yongtang Shi
The Turán number of a -uniform hypergraph , denoted by , is the maximum number of edges in any -uniform hypergraph on vertices which doe…
Degree powers in -free graphs
Ran Gu, Xueliang Li, Yongtang Shi
Let be a graph with degree sequence . Given a positive integer , denote by . Caro and Yuster introduced a Turán-type problem f…
The generalized 3-connectivity of random graphs
Ran Gu, Xueliang Li, Yongtang Shi
The generalized connectivity of a graph was introduced by Chartrand et al. Let be a nonempty set of vertices of , and be defined as the largest number of internal…