Knots and links in certain spatial complete graphs (Q1924155)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Knots and links in certain spatial complete graphs
scientific article

    Statements

    Knots and links in certain spatial complete graphs (English)
    0 references
    0 references
    23 March 1997
    0 references
    The author proves that in a canonical book representation of \(K_n\) each link consisting of a pair of disjoint 3-cycles is either a trivial link or a Hopf link and the number of such Hopf links is exactly \((\begin{smallmatrix} n\\ 6\end{smallmatrix})\) for \(n\geq6\). Furthermore, each 7-cycle knot is either a trivial knot or a trefoil and the number of such trefoils is exactly \((\begin{smallmatrix} n\\ 7\end{smallmatrix})\) for \(n\geq 7\).
    0 references
    complete graph
    0 references
    Hopf link
    0 references
    knot
    0 references
    trefoil
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references