Proving Graphs are Minor Minimal
In the field of topology, a graph is a set of vertices with certain vertices connected to each other by edges. An intrinsically knotted graph is a graph that is guaranteed to contain a knot no matter which way you arrange the vertices, edges, and how the edges cross over each other. We proved that certain graphs are minor minimal: they are the ?smallest? and ?most reduced? they can be and still be intrinsically knotted.
Goldberg, Noam, " Proving Graphs are Minor Minimal" (2009). URC Student Scholarship.
Ford Research Endowment
This document is currently not available here.