Intrinsic knotting and linking of complete graphs
From MaRDI portal
Publication:1597785
DOI10.2140/AGT.2002.2.371zbMATH Open0998.57010arXivmath/0205231OpenAlexW3103980763MaRDI QIDQ1597785FDOQ1597785
Authors: Erica Flapan 
Publication date: 3 June 2002
Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)
Abstract: We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every embedding of K_r in R^3 contains a knot Q with |a_2(Q)| > m-1, where a_2(Q) denotes the second coefficient of the Conway polynomial of Q.
Full work available at URL: https://arxiv.org/abs/math/0205231
Recommendations
- Intrinsic knotting and linking of almost complete graphs
- Intrinsically knotted graphs
- Intrinsically linked graphs with knotted components
- Intrinsic knotting of almost complete partite graphs
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- Intrinsic linking and knotting of graphs in arbitrary 3-manifolds
- On intrinsically knotted or completely 3-linked graphs
- More intrinsically knotted graphs
- Knots and links in certain spatial complete graphs
- Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Cited In (32)
- Intrinsic knotting and linking of almost complete graphs
- Intrinsically triple linked complete graphs
- Intrinsically \(n\)-linked complete graphs
- Knots and links in certain spatial complete graphs
- Every graph has an embedding in 𝑆³ containing no non-hyperbolic knot
- Some Ramsey-type results on intrinsic linking of \(n\)-complexes
- Linking number of monotonic cycles in random book embeddings of complete graphs
- Intrinsic linking and knotting of graphs in arbitrary 3-manifolds
- Some `converses' to intrinsic linking theorems
- Triviality of the function \(\omega_2\) for spatial imbeddings of complete graphs
- Knots and links in spatial graphs: a survey
- Intrinsically linked graphs with knotted components
- Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs
- Weakly linked embeddings of pairs of complete graphs in \(\mathbb{R}^3\)
- Intrinsically knotted graphs
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- Counting links and knots in complete graphs
- Knotting and linking in the Petersen family
- Linear embeddings of \(K_{9}\) are triple linked
- Counting links in complete graphs
- INTRINSICALLY n-LINKED COMPLETE BIPARTITE GRAPHS
- Proving \(n\)-dimensional linking in complete \(n\)-complexes in \((2n+1)\)-dimensional space
- Intrinsic linking and knotting are arbitrarily complex in directed graphs
- A graph-theoretic approach to a partial order of knots and links
- Intrinsically knotted and 4-linked directed graphs
- Intrinsically linked graphs and even linking number
- Knots in the canonical book representation of complete graphs
- Intrinsic linking with linking numbers of specified divisibility
- Most graphs are knotted
- Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs
- A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
- Knots in certain spatial graphs
This page was built for publication: Intrinsic knotting and linking of complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1597785)
