Intrinsically linked graphs and even linking number
From MaRDI portal
Publication:2571389
DOI10.2140/agt.2005.5.1419zbMath1099.57006arXivmath/0511133OpenAlexW2156225933WikidataQ56431012 ScholiaQ56431012MaRDI QIDQ2571389
Alexander J. Diesl, Thomas R. 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS ⋮ Some Ramsey-type results on intrinsic linking of \(n\)-complexes ⋮ LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7 ⋮ Counting links in complete graphs ⋮ Intrinsic linking with linking numbers of specified divisibility
Cites Work
- Unnamed Item
- Intrinsic knotting and linking of complete graphs
- Sachs' linkless embedding conjecture
- INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS
- Knots and links in spatial graphs
- A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
- INTRINSICALLY n-LINKED GRAPHS
- ON THE SIZE OF LINKS IN Kn, n, Kn, n, 1, AND Kn
- SOME NEW INTRINSICALLY 3-LINKED GRAPHS
- GRAPHS WITH DISJOINT LINKS IN EVERY SPATIAL EMBEDDING
- INTRINSICALLY LINKED GRAPHS AND THE SATO–LEVINE INVARIANT
- Intrinsically triple linked complete graphs
This page was built for publication: Intrinsically linked graphs and even linking number