paper

Graphs on 21 edges that are not 2--apex

arXiv:1506.06789 · doi:10.2140/involve.2016.9.591

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.

arXiv commentSubmitted to Involve

References in corpus (5)

Cited by in corpus (5)