Title

Proving Graphs are Minor Minimal

Authors

Noam Goldberg

Document Type

Article

Publication Date

2009

Abstract

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.

Advisor

Ramin Naimi

Department

math

Support

Ford Research Endowment



This document is currently not available here.

Share

COinS