Luyining Gan

According to our database, Luyining Gan authored at least 5 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Zero forcing with random sets.

Bryan Curtis, Luyining Gan, Jamie Haddock, Rachel Lawrence, Sam Spiro

Discret. Math., 2024

2023

Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs.

Luyining Gan, Jie Han, Lin Sun, Guanghui Wang

J. Graph Theory, November, 2023

An algorithmic version of the Hajnal-Szemer\'edi theorem.

Luyining Gan, Jie Han, Jie Hu

CoRR, 2023

2022

Hamiltonicity in Cherry-quasirandom 3-graphs.

Luyining Gan, Jie Han

Eur. J. Comb., 2022

The Decision Problem for Perfect Matchings in Dense Hypergraphs.

Luyining Gan, Jie Han

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022