Intrinsically knotted graphs with 21 edges

MaRDI QIDQ6240684zbMATH OpenFDO

Authors Jamison Barsotti, T. Mattman

Publication date 27 March 2013

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Abstract: We show that the 14 graphs obtained by $ablamathrmY$ 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 $ablamathrmY$ and $mathrmYabla$ moves on K_7, is the list of graphs of size 21 that are minor minimal with respect to the property not 2--apex.

This page was built for publication: Intrinsically knotted graphs with 21 edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6240684)