18 citations · 22 across the 3 of their papers we have counts for
6 papers
Hamilton -cycles in randomly-perturbed hypergraphs
Andrew McDowell, Richard Mycroft
We prove that for integers and a small constant , if a -uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edg…
Dispersion processes
Colin Cooper, Andrew McDowell, Tomasz Radzik +2
We study a synchronous dispersion process in which particles are initially placed at a distinguished origin vertex of a graph . At each time step, at each vertex occupie…
Contagious sets in a degree-proportional bootstrap percolation process
Frederik Garbe, Andrew McDowell, Richard Mycroft
We study the following bootstrap percolation process: given a connected graph , a constant and an initial set of \emph{infected} vertices, at ea…
Triangle-tilings in graphs without large independent sets
József Balogh, Andrew McDowell, Theodore Molla +1
We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an -vertex graph with sublinear independence number. In th…
DNA origami and the complexity of Eulerian circuits with turning costs
Joanna A. Ellis-Monaghan, Andrew McDowell, Iain Moffatt +1
Building a structure using self-assembly of DNA molecules by origami folding requires finding a route for the scaffolding strand through the desired structure. When the target stru…
Non-Vertex-Balanced Factors in Random Graphs
Stefanie Gerke, Andrew McDowell
We prove part of a conjecture by Johansson, Kahn and Vu \cite{JKV} regarding threshold functions for the existence of an -factor in a random graph \gnp. We prove that the conjec…