Tian-Hong Kan

collaborators

2 papers

math.CO2026

Stability and exact extremal colourings for the Alon--Frankl--Lovász bound

Tianhong Kan, Hongliang Lu, Feihong Yuan

The Alon--Frankl--Lovász theorem states that every $q$ -colouring of the edges of the complete $r$ -uniform hypergraph on $n$ vertices contains a monochromatic matching of size $\lfl…

math.CO2026

Ore-degree conditions for hypergraph matchings

Mingyang Guo, Tianhong Kan, Hongliang Lu +1

Let $σ_{k} (H)$ be the minimum sum of the vertex degrees over all non-edges of an $n$ -vertex $k$ -uniform hypergraph $H$ . For every $k \geq 3$ , $n \geq k s$ and sufficiently large $n$ , we e…