The Decision Problem for Perfect Matchings in Dense Hypergraphs. - Luyining Gan; Jie Han 002 (ICALP, 2022)

Hamiltonicity in Cherry-quasirandom 3-graphs. - Luyining Gan; Jie Han 002 (Eur. J. Comb., 2022)

An algorithmic version of the Hajnal-Szemer 'edi theorem. - Luyining Gan; Jie Han 002; Jie Hu (CoRR, 2023)

Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $ ell $-cycles in k $k$-uniform hypergraphs. - Luyining Gan; Jie Han 002; Lin Sun; Guanghui Wang 002 (J. Graph Theory, 2023)

Zero forcing with random sets. - Bryan Curtis; Luyining Gan; Jamie Haddock; Rachel Lawrence; Sam Spiro (Discret. Math., 2024)

On the Keevash-Knox-Mycroft conjecture. - Luyining Gan; Jie Han 002 (J. Comb. Theory B, 2025)