2 papers
math.PR2019
Long paths and connectivity in {}-independent random graphs
A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock
Given a graph , a probability measure on the subsets of the edge set of is said to be -independent if events determined by edge sets that are at graph distance at lea…
math.CO2018
Maker-Breaker Percolation Games I: Crossing Grids
A. Nicholas Day, Victor Falgas-Ravry
Motivated by problems in percolation theory, we study the following 2-player positional game. Let be a rectangular grid-graph with vertices in each row and …