Luyining Gan

collaborators

5 papers

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)$ ,…

math.CO2026

On the Keevash-Knox-Mycroft Conjecture

Luyining Gan, Jie Han

Given $1 \leq ℓ < k$ and $I^´ \geq 0$ , let $PM (k, ℓ, I^´)$ be the decision problem for the existence of perfect matchings in $n$ -vertex $k$ -uniform hypergraphs with minimum $\…

math.CO2026

A parameterized algorithm for $K_{r}$ -factors in graphs of high minimum degree

Luyining Gan, Jie Han, Jie Hu

A $K_{r}$ -factor of a graph $G$ is a collection of vertex-disjoint $r$ -cliques covering $V (G)$ . We prove the following algorithmic version of the classical Hajnal--SzemerÃ©di Theorem…

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

On the Keevash-Knox-Mycroft Conjecture

A parameterized algorithm for Kr​-factors in graphs of high minimum degree

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

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

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

A parameterized algorithm for $K_{r}$ -factors in graphs of high minimum degree

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