arXiv:2402.10633 [math.CO]AbstractReferencesReviewsResources
Crossing number of graphs and $\mathsf{ΔY}$-move
Published 2024-02-16Version 1
The crossing number of a graph is the minimum number of double points over all generic immersions of the graph into the plane. In this paper we investigate the behavior of crossing number under a graph transformation, called $\mathsf{\Delta Y}$-move, on the complete graph $K_n$. Concretely it is shown that for any $k\in \mathbb{N}$, there exist a natural number $n$ and a sequence of $\mathsf{\Delta Y}$-moves $K_n\rightarrow G^{(1)}\rightarrow \cdots \rightarrow G^{(k)}$ which is decreasing with respect to the crossing number. We also discuss the decrease of crossing number for relatively small $n$.
Comments: 17 pages, 14 figures
Related articles: Most relevant | Search more
arXiv:1402.4603 [math.CO] (Published 2014-02-19)
Resolvable 3-star designs
arXiv:1006.3783 [math.CO] (Published 2010-06-18)
Crossings, colorings, and cliques
On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs