2 papers
math.CO2023
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…
math.CO2023
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,…