A new framework for identifying most reliable graphs and a correction to the $K_{3,3}$-theorem

Lorents F. Landgren, Jeffrey E. Steif

Given a multigraph $G$, the all-terminal reliability $R(G,p)$ is the probability that $G$ remains connected under percolation with parameter $p$. Fixing the number of vertices $n$…