Intrinsically linked graphs and even linking number

DOI10.2140/AGT.2005.5.1419zbMATH Open1099.57006arXivmath/0511133OpenAlexW2156225933WikidataQ56431012 ScholiaQ56431012MaRDI QIDQ2571389FDOQ2571389

Authors: Alexander J. Diesl, Thomas Fleming 

Publication date: 1 November 2005

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

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.

Full work available at URL: https://arxiv.org/abs/math/0511133

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

zbMATH Keywords

graph embeddinglinking numberintrinsically linked

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K₇
• Intrinsically \(n\)-linked complete graphs
• Some Ramsey-type results on intrinsic linking of \(n\)-complexes
• Intrinsic linking and knotting of graphs in arbitrary 3-manifolds
• Intrinsically linked graphs with knotted components
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• Capturing links in spatial complete graphs
• INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
• Counting links in complete graphs
• Intrinsic linking with linking numbers of specified divisibility
• INTRINSICALLY n-LINKED GRAPHS
• On graphs for which every planar immersion lifts to a knotted spatial embedding
• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT

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)