15 citations · 37 across the 16 of their papers we have counts for
16 papers
The degree and codegree threshold for generalized triangle and some trees covering
Ran Gu, Shuaichao Wang
Given two -uniform hypergraphs and , we say that has an -covering if for every vertex in there is a copy of covering it. For , the minimum…
On extremal problems on multigraphs
Ran Gu, Shuaichao Wang
An -graph is an -vertex multigraph in which every -set of vertices spans at most edges. Erdős initiated the study of maximum number of edges of -graphs,…
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 and an in-branching wh…
Bounds for Gallai-Ramsey functions and numbers
Zhao Wang, Yaping Mao, Ran Gu +2
For two graphs and a positive integer , the \emph{Gallai-Ramsey number} is defined as the minimum number of vertices such that any -edge-…
Anti-Ramsey numbers of paths and cycles in hypergraphs
Ran Gu, Jiaao Li, Yongtang Shi
The anti-Ramsey problem was introduced by Erdős, Simonovits and Sós in 1970s. The anti-Ramsey number of a hypergraph , , is the smallest integer…
Conflict-free connection number of random graphs
Ran Gu, Xueliang Li
An edge-colored graph is conflict-free connected if any two of its vertices are connected by a path which contains a color used on exactly one of its edges. The conflict-free c…