3 papers
math.CO2021
Hamilton transversals in random Latin squares
Stephen Gould, Tom Kelly
Gyárfás and Sárközy conjectured that every Latin square has a `cycle-free' partial transversal of size . We confirm this conjecture in a strong sense for almost al…
math.CO2020
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
Stephen Gould, Tom Kelly, Daniela Kühn +1
A subgraph of an edge-coloured graph is called rainbow if all of the edges of have different colours. In 1989, Andersen conjectured that every proper edge-colouring of $K_{…
math.CO2019
Counting Hamilton cycles in Dirac hypergraphs
Stefan Glock, Stephen Gould, Felix Joos +2
A tight Hamilton cycle in a -uniform hypergraph (-graph) is a cyclic ordering of the vertices of such that every set of consecutive vertices in the ordering forms…