"Unavoidable Immersions and Intertwines of Graphs"

The topological minor and the minor relations are well-studied binary relations on the class of graphs. A natural weakening of the topological minor relation is an immersion. An immersion of a graph *H* into a graph *G *is a map that injects the vertex set of *H* into the vertex set of *G *such that edges between vertices of *H* are represented by pairwise-edge-disjoint paths of *G*. In this dissertation, we present two results: the first giving a set of unavoidable immersions of large 3-edge-connected graphs and the second on immersion intertwines of infinite graphs. These results, along with the methods used to prove them, are analogues of results on the graph minor relation. A conjecture for the unavoidable immersions of large 3-edge-connected graphs is also stated with a partial proof.