UVictoria Discrete Math Seminar: Haley Freigang

An edge mapping of a graph is a function f:E(G) -> E(G) where f(e) \neq e for all e in E(G). A subgraph H of G is called f-free if for every e in E(H) f(e) \notin E(H). A graph G is called unavoidable for a graph H if every edge mapping of G has at least one f-free copy of H and minimally unavoidable if no proper subgraph of G also satisfies this property. In this talk, we will discuss the set of all minimally unavoidable graphs for a graph H for several different types of graphs H.