All Questions
1 question
1
vote
1
answer
279
views
Ways to prove that $n$-component Brunnian link is nontrivial
The attached image shows a way to construct an $n$-component Brunnian link for any $n\geq 3$. That is, this link is not trivial, but deleting any of its components makes the new link trivial. The ...
- 214