Finding long cycles in a percolated expander graphs

Abstract

Given a graph $G$, the percolated graph $G_p$ has each edge independently retained with probability $p$. Collares, Diskin, Erde, and Krivelevich initiated the study of large structures in percolated single-scale vertex expander graphs, wherein every set of exactly $k$ vertices of $G$ has at least $dk$ neighbours before percolation. We extend their result to a conjectured stronger form, proving that if $p=(1+\epsilon )/d$ and $G$ is a graph on at least $k$ vertices which expands as above, then $G_p$ contains a cycle of length ${\Omega }_{\epsilon }(kd)$ with probability at least $1-\exp (-{\Omega }_{\epsilon }(k/d))$ as $k\to \infty$.

arXiv comment11 pages