pith. sign in

arxiv: 1303.6911 · v1 · pith:LMYVHT6Rnew · submitted 2013-03-27 · 🧮 math.GT · math.CO

Intrinsically knotted graphs with 21 edges

classification 🧮 math.GT math.CO
keywords graphsmathrmnablaedgesintrinsicallyknottedlistminimal
0
0 comments X
read the original abstract

We show that the 14 graphs obtained by $\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 $\nabla\mathrm{Y}$ and $\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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.