collaborators

7 papers

math.CO2026

Sharp Diagonal Thresholds for Tight Hamilton Cycles in Uniformly Dense -Graphs

Hao Lin, Guanghui Wang, Wenling Zhou

A -uniform hypergraph (or -graph) on vertices is \emph{-dense} if for all . This is one of the weakest…

math.CO2026

Pancyclicity of graphs perturbed by a random -factor

Dingjia Mao, Feihong Yuan, Wenling Zhou

We determine the sharp minimum-degree threshold for Hamiltonicity in graphs perturbed by a uniformly random -factor, resolving a conjecture of Espuny Díaz and Girão [Random…

math.CO2026

Uniform Turán densities of -uniform hypergraphs

Hao Lin, Guowei Sun, Guanghui Wang +1

For , the -uniform Turán density of a -graph is the supremum of for which there are arbitrarily large -free -graphs that are uniforml…

math.CO2026

Turán density of stars in uniformly dense hypergraphs

Hao Lin, Wenling Zhou

A -uniform hypergraph (or -graph) is -\emph{dense} if for any subsets , the number of triples such that $…

math.CO2026

Extremal problems in uniformly dense hypergraphs and digraphs

Hao Lin, Guanghui Wang, Wenling Zhou +1

The uniform Turán density of a -uniform hypergraph (or -graph) is the supremum of all such that there exist infinitely many -free -graphs in wh…

math.CO2025

Degree conditions for spanning expansion hypertrees

Mengjiao Rao, Nicolás Sanhueza-Matamala, Lin Sun +2

The -expansion of a graph is the -uniform hypergraph obtained from by adding new vertices to every edge. We determine, for all , asymptotically op…