On the Decycling Number of $4$-regular Random Graphs

Lyuben Lichev, Dieter Mitsche

The decycling number $\varphi (G)$ of a graph $G$ is the smallest number of vertices which can be removed from $G$ so that the resulting graph has no cycles. Bau, Wormald and Zhou conject…