24 citations · 153 across the 39 of their papers we have counts for
55 papers
Cycle tilings and -factors in directed graphs
Theodore Molla, Andrew Treglown
We prove several results concerning cycle tilings and -factors in digraphs. We provide a minimum semi-degree condition for forcing a digraph to contain a given spanning collecti…
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
Louis DeBiasio, Andrew Treglown
In 1960, Ghouila-Houri proved that every strongly connected directed graph on vertices with minimum degree at least contains a directed Hamilton cycle. We asymptoticall…
Ramsey-type problems for tilings in dense graphs
József Balogh, Andrea Freschi, Andrew Treglown
Given a graph , the Ramsey number is the smallest positive integer such that every -edge-colouring of yields a monochromatic copy of . We write to de…
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 th power of a Hamilton cycle in a graph. After numerous partial results, Komlós, Sárközy and…
Colour-bias perfect matchings in hypergraphs
Hiêp Hàn, Richard Lang, João Pedro Marciano +4
We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main r…
Typical Ramsey properties of the primes, abelian groups and other discrete structures
Andrea Freschi, Robert Hancock, Andrew Treglown
Given a matrix with integer entries, a subset of an abelian group and , we say that is -Rado if any -colouring of yields a monochromatic…