On the number of links in a linearly embedded K_(3,3,1)
classification
🧮 math.GT
math.CO
keywords
linkscomponentembeddedembeddingexistslinearlinearlynontrivial
read the original abstract
We show there exists a linear embedding of $K_{3,3,1}$ with n nontrivial 2-component links if and only if n = 1, 2, 3, 4, or 5.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.