Graphs on 21 edges that are not 2--apex
Combinatorics
2016-08-03 v1 Geometric Topology
Abstract
We show that the 20 graph Heawood family, obtained by a combination of triangle-Y and Y-triangle moves on , is precisely the set of graphs of at most 21 edges that are minor minimal for the property not --apex. As a corollary, this gives a new proof that the 14 graphs obtained by triangle-Y moves on are the minor minimal intrinsically knotted graphs of 21 or fewer edges. Similarly, we argue that the seven graph Petersen family, obtained from , is the set of graphs of at most 17 edges that are minor minimal for the property not apex.
Keywords
Cite
@article{arxiv.1506.06789,
title = {Graphs on 21 edges that are not 2--apex},
author = {Jamison Barsotti and Thomas W. Mattman},
journal= {arXiv preprint arXiv:1506.06789},
year = {2016}
}
Comments
Submitted to Involve