Long paths and connectivity in {$1$}-independent random graphs

A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock

Given a graph $G$, a probability measure $\mu$ on the subsets of the edge set of $G$ is said to be $1$-independent if events determined by edge sets that are at graph distance at lea…