Minimal crossing diagrams of spatial graphs
Erica Flapan, Hugh Howards
TL;DR
This paper extends Tait's conjecture on minimal crossing diagrams to spatial graphs by developing adequacy-based frameworks for $1$-vertex graphs and for planar frameworks, using $all$-$A$ and $all$-$A^{-1}$ resolutions and tangle diagrams to connect graph diagrams to adequate link diagrams. It proves that adequate $1$-vertex graphs have minimal crossing number and that replacing edges and vertices of a planar framework by minimal-crossing components preserves minimality, thereby generalizing Sawollek's results to broader graph classes. The work also analyzes rigid vertex spatial graphs, providing a concrete example that answers a question of Adams et al. about minimal crossing diagrams under rigid isotopy. Collectively, the results give practical criteria for minimality across diverse spatial-graph families and illuminate how adequacy, planarity, and rigidity influence crossing number behavior.
Abstract
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.
