Exactly fourteen intrinsically knotted graphs have 21 edges (Q907769): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.2140/agt.2015.15.3305 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1544490788 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1207.7157 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2140/AGT.2015.15.3305 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:11, 10 December 2024

scientific article
Language Label Description Also known as
English
Exactly fourteen intrinsically knotted graphs have 21 edges
scientific article

    Statements

    Exactly fourteen intrinsically knotted graphs have 21 edges (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2016
    0 references
    This paper proves that \(K_7\) and the thirteen graphs obtained from it by \(\Delta Y\) moves are the only intrinsically knotted graphs with 21 edges. This is the minimal number of edges a minimally knotted graph can have [\textit{B. Johnson} et al., J. Knot Theory Ramifications 19, No. 11, 1423--1429 (2010; Zbl 1232.57004)]. The result follows from showing that all triangle-free intrinsically knotted graphs with exactly 21 edges are either homeomorphic to \(H_{12}\) or \(C_{14}\) or are 2-apex and therefore not intrinsically knotted.
    0 references
    0 references
    intrinsically knotted graphs
    0 references

    Identifiers