Allan Lo

collaborators

3 papers

math.CO2026

Towards PÃ³sa's Conjecture for $3$ -graphs

Debmalya Bandyopadhyay, Allan Lo, Richard Mycroft

We prove that every $3$ -graph $H$ on $n$ vertices with minimum codegree $I^´_{2} (H) \geq 7 n /9 + o (n)$ contains the square of a tight Hamilton cycle. This strengthens a theorem of Bede…

math.CO2026

Compatible Hamilton cycles in graphs with large minimum degree

Natalie Behague, Francesco Di Braccio, Bertille Granet +1

The renowned theorem of Dirac states that if $G$ is a graph with minimum degree at least $n /2$ then $G$ has a Hamilton cycle. A natural generalisation asks what properties of an ed…

math.CO2025

Powers of Hamilton cycles in oriented and directed graphs

Louis DeBiasio, Jie Han, Allan Lo +3

The PÃ³sa--Seymour conjecture determines the minimum degree threshold for forcing the $k$ th power of a Hamilton cycle in a graph. After numerous partial results, KomlÃ³s, SÃ¡rkÃ¶zy…

Towards PÃ³sa's Conjecture for 3-graphs

Compatible Hamilton cycles in graphs with large minimum degree

Powers of Hamilton cycles in oriented and directed graphs

Towards PÃ³sa's Conjecture for $3$ -graphs