2013/03/27 by Jamison Barsotti, Barsotti, Jamison, Thomas W. Mattman +1
Computer Science · Mathematics · #05C10 (Primary) 57M15 #57M25 (Secondary) #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Geometric Topology (math.GT) #math.CO #math.GT #msc:05C10 #msc:57M15 #msc:57M25
paper · pdf · doi:10.48550/arxiv.1303.6911
21 pages, 11 figures
arxiv created 2013/03/27 · openalex publication_date 2013/03/27 · arxiv updated 2013/03/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that the 14 graphs obtained by \nablaY moves on K7 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 \nablaY and Y∇ moves on K7, is the list of graphs of size 21 that are minor minimal with respect to the property not 2--apex.