Intrinsically knotted graphs with 21 edges
Geometric Topology
2013-03-28 v1 Combinatorics
Abstract
We show that the 14 graphs obtained by 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 and moves on K_7, is the list of graphs of size 21 that are minor minimal with respect to the property not 2--apex.
Cite
@article{arxiv.1303.6911,
title = {Intrinsically knotted graphs with 21 edges},
author = {Jamison Barsotti and Thomas W. Mattman},
journal= {arXiv preprint arXiv:1303.6911},
year = {2013}
}
Comments
21 pages, 11 figures