Feihong Yuan

collaborators

7 papers

math.CO2026

Exact Minimum $d$ -Degree Thresholds for Hypergraph Perfect Matchings

Jie Han, Hongliang Lu, Bin Wang +1

For fixed integers $k \geq 3$ and $1 \leq d \leq k - 1$ and sufficiently large $n \in k N$ , we establish the sharp minimum $d$ -degree thresholds that forces perfect matching in every…

math.CO2026

Perfect matching in 4-partite 4-uniform hypergraphs

Hongliang Lu, Yan Wang, Feihong Yuan

A balanced $k$ -partite $k$ -graph is a $k$ -uniform hypergraph such that every edge intersects each partition class in exactly one vertex, where each partition class has size $n$ . Lo…

math.CO2026

On the codegree threshold for Hamilton $ℓ$ -cycles in $k$ -uniform hypergraphs

Hongliang Lu, Feihong Yuan

In this note, we resolve the remaining open case of a conjecture by Han and Zhao concerning the codegree threshold for Hamilton $ℓ$ -cycles in $k$ -uniform hypergraphs. Specifical…

math.CO2026

Pancyclicity of graphs perturbed by a random $F$ -factor

Dingjia Mao, Feihong Yuan, Wenling Zhou

We determine the sharp minimum-degree threshold for Hamiltonicity in graphs perturbed by a uniformly random $K_{r}$ -factor, resolving a conjecture of Espuny DÃaz and GirÃ£o [Random…

math.CO2026

A spectral condition for perfect matchings in 3-partite 3-graphs

Hongliang Lu, Feihong Yuan

Let $H$ be a 3-partite 3-uniform hypergraph whose three vertex classes all have size $n$ . For a vertex $v \in V (H)$ , the link graph $N_{H} (v)$ is defined on $V (H) ∖ {v}$ with…

math.CO2026

A local spectral condition for perfect matchings in 3-graphs

Huiqiu Lin, Hongliang Lu, Feihong Yuan +1

Let $I^^{3}$ be a constant such that $0 < I^^{3} < 1$ , and let $n$ be a sufficiently large integer. Consider a $3$ -uniform hypergraph $H$ on $n$ vertices. In 2013, KÃ¼hn, Osthus, and Treglo…

Exact Minimum d-Degree Thresholds for Hypergraph Perfect Matchings

Perfect matching in 4-partite 4-uniform hypergraphs

On the codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs

Pancyclicity of graphs perturbed by a random F-factor

A spectral condition for perfect matchings in 3-partite 3-graphs

A local spectral condition for perfect matchings in 3-graphs

Exact Minimum $d$ -Degree Thresholds for Hypergraph Perfect Matchings

On the codegree threshold for Hamilton $ℓ$ -cycles in $k$ -uniform hypergraphs

Pancyclicity of graphs perturbed by a random $F$ -factor