Unavoidable immersions of 4- and $f(t)$-edge-connected graphs

Guoli Ding, Brittian Qualls

In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2,r}$, as an immersion. In proving this, we develop a new tool we call a…