Nonexistence of uniformly most reliable graphs of least corank

Pablo Romero, Martín D. Safe

If $G$ is a simple graph and $\rho \in [0,1]$, the reliability $R_G(\rho )$ is the probability of $G$ being connected after each of its edges is removed independently with probability $\rho$.…