Luyining Gan

activity

20202026

most citedHamiltonicity in Cherry-quasirandom 3-graphs

1 citations · 2 across the 15 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Decision problem for Hamilton $2$ -cycles in $4$ -graphs

Luyining Gan, Jie Han, Bin Wang

A $4$ -uniform $2$ -cycle in a $4$ -uniform hypergraph of length $t$ is a cyclic ordering of $2 t$ vertices $v_{1} v_{2} \dots v_{2 t} v_{1}$ such that $v_{2 i + 1} v_{2 i + 2} v_{2 i + 3} v_{2 i + 4}$ are ed…

math.CO2026

Note on the codegree version of the Erdős--Ko--Rado theorem

Luyining Gan, Jie Han, Seonghyuk Im

Kupavskii proved a codegree version of the Erdős--Ko--Rado theorem by showing that for an intersecting family $F \subseteq (k [ n ])$ with $n \geq 2 k + 3 d / (1 - d / k)$ , t…

math.CO2026

Exact minimum co-degree conditions for $ℓ$ -Hamiltonicity in hypergraphs

Luyining Gan, Jie Han, Huan Xu

Suppose $1 \leq ℓ < k$ such that $(k - ℓ) ∤ k$ . Given an $n$ -vertex $k$ -uniform hypergraph $H$ , for all $k /2 < ℓ < 3 k /4$ and sufficiently large $n\in (k-\ell)\mathbb N…

Decision problem for Hamilton 2-cycles in 4-graphs

Note on the codegree version of the Erdős--Ko--Rado theorem

Exact minimum co-degree conditions for ℓ-Hamiltonicity in hypergraphs

Decision problem for Hamilton $2$ -cycles in $4$ -graphs

Exact minimum co-degree conditions for $ℓ$ -Hamiltonicity in hypergraphs