Minimal crossing diagrams of spatial graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911262338711552 |
|---|---|
| author | Flapan, Erica Howards, Hugh |
| author_facet | Flapan, Erica Howards, Hugh |
| contents | We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph diagrams have minimal crossing number. Finally, we give an example in answer to a question of Adams et al. about minimal crossing diagrams of rigid vertex graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_09712 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimal crossing diagrams of spatial graphs Flapan, Erica Howards, Hugh Combinatorics Geometric Topology 57K10, 57M15, 05C10 We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph diagrams have minimal crossing number. Finally, we give an example in answer to a question of Adams et al. about minimal crossing diagrams of rigid vertex graphs. |
| title | Minimal crossing diagrams of spatial graphs |
| topic | Combinatorics Geometric Topology 57K10, 57M15, 05C10 |
| url | https://arxiv.org/abs/2511.09712 |