Hao Lin

collaborators

5 papers

math.CO2026

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

Hao Lin, Guanghui Wang, Wenling Zhou

A $3$ -uniform hypergraph (or $3$ -graph) $H$ on $n$ vertices is \emph{ $(n, d, I^¼)$ -dense} if $e_{H} (X, Y, Z) \geq d ∣ X ∣∣ Y ∣∣ Z ∣ - I^¼ n^{3}$ for all $X, Y, Z \subseteq V (H)$ . This is one of the weakest…

math.CO2026

Uniform TurÃ¡n densities of $k$ -uniform hypergraphs

Hao Lin, Guowei Sun, Guanghui Wang +1

For $k \geq 3$ , the $(k - 2)$ -uniform TurÃ¡n density $I ¨ _{k - 2} (F)$ of a $k$ -graph $F$ is the supremum of $d$ for which there are arbitrarily large $F$ -free $k$ -graphs that are uniforml…

math.CO2026

TurÃ¡n density of stars in uniformly dense hypergraphs

Hao Lin, Wenling Zhou

A $3$ -uniform hypergraph (or $3$ -graph) $H = (V, E)$ is $(d, I^¼, 1)$ -\emph{dense} if for any subsets $X, Y, Z \subseteq V$ , the number of triples $(x, y, z) \in X \times Y \times Z$ such that $…

math.CO2026

Extremal problems in uniformly dense hypergraphs and digraphs

Hao Lin, Guanghui Wang, Wenling Zhou +1

The uniform TurÃ¡n density $I ¨ _{u} (F)$ of a $3$ -uniform hypergraph (or $3$ -graph) $F$ is the supremum of all $d$ such that there exist infinitely many $F$ -free $3$ -graphs $H$ in wh…

math.CO2025

A strengthening on consecutive odd cycles in graphs of given minimum degree

Hao Lin, Guanghui Wang, Wenling Zhou

Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$ -connected non-bipartite graph with minimum degree at least $k + 1$ contains $⌈ k /2 ⌉$ cycles with con…

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

Uniform TurÃ¡n densities of k-uniform hypergraphs

TurÃ¡n density of stars in uniformly dense hypergraphs

Extremal problems in uniformly dense hypergraphs and digraphs

A strengthening on consecutive odd cycles in graphs of given minimum degree

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

Uniform TurÃ¡n densities of $k$ -uniform hypergraphs