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

2 papers · 1 filter

math.CO2023

The degree and codegree threshold for generalized triangle and some trees covering

Ran Gu, Shuaichao Wang

Given two $k$ -uniform hypergraphs $F$ and $G$ , we say that $G$ has an $F$ -covering if for every vertex in $G$ there is a copy of $F$ covering it. For $1 \leq i \leq k - 1$ , the minimum…

math.CO2023

On extremal problems on multigraphs

Ran Gu, Shuaichao Wang

An $(n, s, q)$ -graph is an $n$ -vertex multigraph in which every $s$ -set of vertices spans at most $q$ edges. Erdős initiated the study of maximum number of edges of $(n, s, q)$ -graphs,…