Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime

Lyuben Lichev

Fix a graph $G$ in which every edge is colored in some of $k\ge 2$ colors. Two vertices $u$ and $v$ are CA-connected if $u$ and $v$ may be connected using any subset of $k-1$ col…