Intrinsic knotting and linking of complete graphs
From MaRDI portal
Publication:1597785
DOI10.2140/agt.2002.2.371zbMath0998.57010arXivmath/0205231OpenAlexW3103980763MaRDI QIDQ1597785
Publication date: 3 June 2002
Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0205231
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
INTRINSICALLY LINKED GRAPHS WITH KNOTTED COMPONENTS ⋮ Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\) ⋮ Some Ramsey-type results on intrinsic linking of \(n\)-complexes ⋮ Counting links and knots in complete graphs ⋮ Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs ⋮ Counting links in complete graphs ⋮ Intrinsic linking with linking numbers of specified divisibility ⋮ Every graph has an embedding in 𝑆³ containing no non-hyperbolic knot ⋮ A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT ⋮ Intrinsically linked graphs and even linking number ⋮ Knots and links in spatial graphs: a survey
This page was built for publication: Intrinsic knotting and linking of complete graphs
