1 citations · 2 across the 11 of their papers we have counts for
4 papers · 1 filter
Minimising the harmonic sum of cycle lengths
Richard Montgomery, Aleksa Milojević, Alexey Pokrovskiy +1
A central theme in extremal graph theory is to understand the relationship between the density of a graph and the richness of its cycle length spectrum, which is the set of distinc…
A proof of Andersen's rainbow path conjecture for large
Candida Bowtell, Richard Montgomery, Alp Müyesser +1
We show that, for sufficiently large , every properly edge-coloured -vertex complete graph contains a path with vertices which uses each colour at most once (that is, a…
Recent progress in graph theory using expansion
Richard Montgomery
Graph expansion has long been recognised as an important and desirable property with applications in a wide range of areas in computer science and mathematics. A particular form of…
Nearly-uniform degree distributions in spanning subgraphs
Richard Montgomery, Alexey Pokrovskiy, Benny Sudakov
We show that, when , every -regular -vertex graph contains a spanning subgraph whose degree distribution is nearly uniform, i.e., for each , there are…