Intrinsically linked graphs and even linking number

DOI10.2140/AGT.2005.5.1419MaRDI QIDQ2571389zbMATH OpenOpenAlexWikidataFDO

Authors Alexander J. Diesl, Thomas Fleming

Publication date 1 November 2005

Published in Algebraic \& Geometric Topology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0511133, https://eudml.org/doc/126636, http://www.emis.de/journals/UW/agt/AGTVol5/agt-5-55.abs.html

zbMATH Keywords

graph embeddingintrinsically linkedlinking number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Abstract: 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) = k2^r, k not 0, a non-split n-component link where all linking numbers are even, or an n-component link with components L, A_i where lk(L,A_i) = 3k, k not 0. 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.

Review text

A graph is called intrinsically linked if all its embeddings into 3-dimensional Euclidean space contain a non-split link, i.e.\ for every embedding there are two disjoint cycles whose images cannot be separated. The starting point of this investigation was independent work from the early 1980's by Sachs and Conway-Gordon who showed that the complete graph on six vertices \(K_6\) is intrinsically linked. In the paper under review it is shown that the linking number of every embedding of \(K_{35}\) contains a non-split link whose linking number is divisible by three und that there is a constant \(\beta_r\) such that every embedding of \(K_{\beta_r}\) contains a non-split link whose linking number is divisible by \(2^r\). Similar results for links with more than two components are proved as well.

Recommendations

• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• INTRINSICALLY n-LINKED GRAPHS
• INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
• Intrinsic knotting and linking of almost complete graphs
• Intrinsically triple linked complete graphs

Cites work

• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• scientific article; zbMATH DE number 3906521 (Why is no real title available?)
• Intrinsic knotting and linking of complete graphs
• INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
• Intrinsically linked graphs with knotted components
• INTRINSICALLY n-LINKED GRAPHS
• Intrinsically triple linked complete graphs
• Knots and links in spatial graphs
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• Sachs' linkless embedding conjecture
• SOME NEW INTRINSICALLY 3-LINKED GRAPHS

Cited in

(18)

• Counting links in complete graphs
• Some Ramsey-type results on intrinsic linking of n-complexes
• A short exposition of Salman Parsa's theorems on intrinsic linking and non-realizability
• Intrinsically linked graphs with knotted components
• Intrinsic 3-linkedness is not preserved by \(\mathrm{Y}\nabla\) moves
• LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K₇
• Intrinsically triple-linked graphs in \(\mathbb{R}P^3\)
• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
• INTRINSICALLY n-LINKED GRAPHS
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• Capturing links in spatial complete graphs
• Intrinsic linking and knotting in tournaments
• Intrinsic linking with linking numbers of specified divisibility
• INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
• Some `converses' to intrinsic linking theorems
• Intrinsically n-linked complete graphs
• Intrinsic linking and knotting of graphs in arbitrary 3-manifolds
• On graphs for which every planar immersion lifts to a knotted spatial embedding

This page was built for publication: Intrinsically linked graphs and even linking number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571389)