Long paths and cycles in random subgraphs of graphs with large minimum degree

Stefan Ehard, Felix Joos

For a graph $G$ and $p\in [0,1]$, let $G_p$ arise from $G$ by deleting every edge mutually independently with probability $1-p$. The random graph model $(K_n{)}_p$ is certainly the m…