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 2020Show all

2 papers · 1 filter

math.CO2020

The smallest number of vertices in a 2-arc-strong digraph which has no good pair

Ran Gu, Gregory Gutin, Shasha Li +2

Bang-Jensen, Bessy, Havet and Yeo showed that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching $B^{+}$ and an in-branching $B^{-}$ wh…

math.CO2020★ 1 cited

Bounds for Gallai-Ramsey functions and numbers

Zhao Wang, Yaping Mao, Ran Gu +2

For two graphs $G, H$ and a positive integer $k$ , the \emph{Gallai-Ramsey number} $gr_{k} (G, H)$ is defined as the minimum number of vertices $n$ such that any $k$ -edge-…