Intrinsically knotted graphs with linklessly embeddable simple minors
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2021
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929324564676608 |
|---|---|
| author | Mattman, Thomas W. Naimi, Ramin Pavelescu, Andrei Pavelescu, Elena |
| author_facet | Mattman, Thomas W. Naimi, Ramin Pavelescu, Andrei Pavelescu, Elena |
| contents | It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph. We present a new intrinsically knotted graph that shows the answer to both questions is no. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2111_08859 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Intrinsically knotted graphs with linklessly embeddable simple minors Mattman, Thomas W. Naimi, Ramin Pavelescu, Andrei Pavelescu, Elena Geometric Topology Combinatorics 57M15 It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph. We present a new intrinsically knotted graph that shows the answer to both questions is no. |
| title | Intrinsically knotted graphs with linklessly embeddable simple minors |
| topic | Geometric Topology Combinatorics 57M15 |
| url | https://arxiv.org/abs/2111.08859 |