Minimal crossing diagrams of spatial graphs
Combinatorics
2025-11-14 v1 Geometric Topology
Abstract
We prove that all -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.
Cite
@article{arxiv.2511.09712,
title = {Minimal crossing diagrams of spatial graphs},
author = {Erica Flapan and Hugh Howards},
journal= {arXiv preprint arXiv:2511.09712},
year = {2025}
}
Comments
11 pages, 13 figures