Ran Gu

activity

20132023

most citedThe generalized 3-connectivity of random graphs

15 citations · 37 across the 16 of their papers we have counts for

collaborators

Showing 2013Show all

5 papers · 1 filter

math.CO2013★ 3 cited

Non-jumping Numbers for 5-Uniform Hypergraphs

Ran Gu, Xueliang Li, Zhongmei Qin +2

Let $ℓ$ and $r$ be integers. A real number $α \in [0, 1)$ is a jump for $r$ if for any $ε > 0$ and any integer $m, m \geq r$ , any $r$ -uniform graph with $n > n_0(\varep…

math.CO2013★ 2 cited

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…

math.CO2013★ 7 cited

Hypergraph Turán numbers of vertex disjoint cycles

Ran Gu, Xueliang Li, Yongtang Shi

The Turán number of a $k$ -uniform hypergraph $H$ , denoted by $e x_{k} (n; H)$ , is the maximum number of edges in any $k$ -uniform hypergraph $F$ on $n$ vertices which doe…

math.CO2013

Degree powers in $C_{5}$ -free graphs

Ran Gu, Xueliang Li, Yongtang Shi

Let $G$ be a graph with degree sequence $d_{1}, d_{2}, \dots, d_{n}$ . Given a positive integer $p$ , denote by $e_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . Caro and Yuster introduced a Turán-type problem f…

math.CO2013★ 15 cited

The generalized 3-connectivity of random graphs

Ran Gu, Xueliang Li, Yongtang Shi

The generalized connectivity of a graph $G$ was introduced by Chartrand et al. Let $S$ be a nonempty set of vertices of $G$ , and $κ (S)$ be defined as the largest number of internal…

Non-jumping Numbers for 5-Uniform Hypergraphs

Some Motzkin-Straus type results for non-uniform hypergraphs

Hypergraph Turán numbers of vertex disjoint cycles

Degree powers in C5​-free graphs

The generalized 3-connectivity of random graphs

Degree powers in $C_{5}$ -free graphs