5 citations · 5 across the 11 of their papers we have counts for
12 papers
The -degree Turán densities of hypergraphs: infinite families and their finite subfamilies
Hao Lin, Wenling Zhou
Let be integers. For a family of -uniform hypergraphs (-graphs), its -degree Turán density is the asymptotic max…
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 s…
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 St…
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 uniformly…
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 whic…
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 $\…
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…
The minimum positive uniform Turán density in uniformly dense -uniform hypergraphs
Hao Lin, Guanghui Wang, Wenling Zhou
A -graph (or -uniform hypergraph) is uniformly dense if the edge distribution of is uniformly dense with respect to every large collection of -vertex cliques induc…
Hypergraphs with a quarter uniform Turán density
Hao Li, Hao Lin, Guanghui Wang +1
The uniform Turán density of a -uniform hypergraph is the supremum over all for which there is an -free hypergraph with the property that every linearly si…
Integer colorings with no rainbow -term arithmetic progression
Hao Lin, Guanghui Wang, Wenling Zhou
In this paper, we study the rainbow Erdős-Rothschild problem with respect to -term arithmetic progressions. For a set of positive integers , an -coloring of…
Integer colorings with no rainbow 3-term arithmetic progression
Xihe Li, Hajo Broersma, Ligong Wang
In this paper, we study the rainbow Erdős-Rothschild problem with respect to 3-term arithmetic progressions. We obtain the asymptotic number of -colorings of without rainb…
Wide-Sense 2-Frameproof Codes
Junling Zhou, Wenling Zhou
Various kinds of fingerprinting codes and their related combinatorial structures are extensively studied for protecting copyrighted materials. This paper concentrates on one specia…