Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs (Q2033480): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3161753438 / rank | |||
Normal rank |
Revision as of 21:48, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs |
scientific article |
Statements
Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs (English)
0 references
17 June 2021
0 references
This paper proves a theorem about two-component links that contain all vertices of an embedding of complete graphs: It is shown that for every spatial complete graph whose number of vertices is greater than six, the sum of the square of the linking numbers over all of the two-component Hamiltonian links (i.e. links containing all vertices) is determined explicitly in terms of the sum over all of the triangle-triangle constituent links. Corollaries for graphs with large number of vertices are proven and consequences for rectilinear (i.e. piecewise linear) embeddings of complete graphs are presented.
0 references
spatial graphs
0 references
Conway-Gordon theorems
0 references
linking number
0 references