Intrinsically knotted graphs with 21 edges

preprint2013arXivOpen access

Abstract

We show that the 14 graphs obtained by ∇Y\nabla\mathrm{Y} moves on K_7 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\nabla\mathrm{Y} and Y∇\mathrm{Y}\nabla moves on K_7, is the list of graphs of size 21 that are minor minimal with respect to the property not 2--apex.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.