PreprintarXiv licencearXiv
Ascending, Bridge, and Unknotting Numbers of Knotted Graphs
Abstract
In this paper we define the ascending number and bridge number for virtual and welded spatial graphs. We prove that the former admits a lower bound in terms of the latter. This relationship allows us to compare different notions of unknotting virtual spatial graphs by crossing changes.
Related
- Bridge numbers of virtual graphs and handlebody-links
- Higher order unknotting numbers for knots and links
- Computation of unknotting numbers: which knot breaks the Bernhard-Jablan Conjecture
- Negative-Definite Plumbings and New Unknotting Numbers
- Four triangle-free intrinsically knotted graphs with 22 edges
BibTeX
@misc{acu2026ascending,
title = {{Ascending, Bridge, and Unknotting Numbers of Knotted Graphs}},
author = {Bahar Acu and Puttipong Pongtanapaisan and Ritikaa Singhal},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.00788},
eprint = {2610.00788},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.00788},
}
RIS
TY - UNPB
TI - Ascending, Bridge, and Unknotting Numbers of Knotted Graphs
AU - Bahar Acu
AU - Puttipong Pongtanapaisan
AU - Ritikaa Singhal
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.00788
UR - https://arxiv.org/abs/2610.00788
AB - In this paper we define the ascending number and bridge number for virtual and welded spatial graphs. We prove that the former admits a lower bound in terms of the latter. This relationship allows us to compare different notions of unknotting virtual spatial graphs by crossing changes.
ER -