Intrinsically linked graphs with knotted components

DOI10.1142/S0218216512500654MaRDI QIDQ2881366zbMATH OpenOpenAlexFDO

Authors Thomas Fleming

Publication date 30 April 2012

Published in Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

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

zbMATH Keywords

spatial graphlinking numberintrinsically linked graph

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 construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nontrivial knots. We then turn our attention to complete graphs and show that for any given n, every embedding of a large enough complete graph contains a two component link whose linking number is a nonzero multiple of n.

Recommendations

• INTRINSICALLY n-LINKED GRAPHS
• Intrinsic knotting and linking of complete graphs
• Intrinsic knotting and linking of almost complete graphs
• INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS

Cites work

• A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
• A newly recognized intrinsically knotted graph
• INTRINSICALLY n-LINKED GRAPHS
• Intrinsic knotting and linking of complete graphs
• Intrinsically knotted graphs
• Intrinsically linked graphs and even linking number
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n
• Realization of knots and links in a spatial graph
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• Sachs' linkless embedding conjecture

Cited in

(18)

• Intrinsic knotting and linking of complete graphs
• Intrinsically triple linked complete graphs
• Some Ramsey-type results on intrinsic linking of n-complexes
• Intrinsic linking and knotting of graphs in arbitrary 3-manifolds
• GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
• Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\)
• GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING
• INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS
• On Conway-Gordon type theorems for graphs in the Petersen family
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Intrinsically knotted and 4-linked directed graphs
• Intrinsically linked graphs and even linking number
• INTRINSICALLY n-LINKED GRAPHS
• Intrinsic linking with linking numbers of specified divisibility
• Intrinsic linking and knotting in tournaments
• An intrinsic nontriviality of graphs

This page was built for publication: Intrinsically linked graphs with knotted components

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