Translator Disclaimer
2005 Intrinsically linked graphs and even linking number
Thomas Fleming, Alexander Diesl
Algebr. Geom. Topol. 5(4): 1419-1432 (2005). DOI: 10.2140/agt.2005.5.1419


We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Examples of properties we address in this paper are: a two component link with lk(A,L)=k2r,k0, a non-split n-component link where all linking numbers are even, or an n-component link with components L,Ai where lk(L,Ai)=3k,k0. Links with other properties are considered as well.

For a given property, we prove that every embedding of a certain complete graph contains a link with that property. The size of the complete graph is determined by the property in question.


Download Citation

Thomas Fleming. Alexander Diesl. "Intrinsically linked graphs and even linking number." Algebr. Geom. Topol. 5 (4) 1419 - 1432, 2005.


Received: 22 April 2004; Revised: 13 September 2005; Accepted: 20 September 2005; Published: 2005
First available in Project Euclid: 20 December 2017

zbMATH: 1099.57006
MathSciNet: MR2171815
Digital Object Identifier: 10.2140/agt.2005.5.1419

Primary: 57M15
Secondary: 05C10, 57M25

Rights: Copyright © 2005 Mathematical Sciences Publishers


Vol.5 • No. 4 • 2005
Back to Top