Theses and Dissertations

G(10,30): A Minor-Minimal Intrinsically Knotted Graph

Date of Award

5-2023

Document Type

Thesis

Degree Name

M.S.

Department

Mathematics

Committee Chair

Dr. Andrei Pavelescu

Advisor(s)

Dr. Elena Pavelescu, Dr. Martin Frank, Dr. Gayan Abeynanda

Abstract

In this paper, we shall lay the groundwork for a proof of the minor-minimal intrinsic knotting of the graph G(10, 30). We show that this graph is in fact minor minimal with respect to the property of intrinsic knotting, i.e that no minor of G(10, 30) is intrinsically knotted. Moreover, we discuss the procedure for showing that G(10, 30) itself is intrinsically knotted, and provide a collection of subgraphs that can be used to aid in a proof. In this way, we hope to contribute to the growing list of known minor-minimal intrinsically knotted graphs.

This document is currently not available here.

Share

COinS