Intrinsically knotted graphs with 21 edges
Abstract
We show that the 14 graphs obtained by ∇Y moves on K7 constitute a complete list of the minor minimal intrinsically knotted graphs on 21 edges. We also present evidence in support of a conjecture that the 20 graph Heawood family, obtained by a combination of ∇Y and Y∇ moves on K7, is the list of graphs of size 21 that are minor minimal with respect to the property not 2--apex.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.