Crossing number of graphs and $\mathsf{ΔY}$-move

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Huh, Youngsik, Nikkuni, Ryo
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866916128302825472
author Huh, Youngsik
Nikkuni, Ryo
author_facet Huh, Youngsik
Nikkuni, Ryo
contents 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{Δ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{Δ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$.
format Preprint
id arxiv_https___arxiv_org_abs_2402_10633
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Crossing number of graphs and $\mathsf{ΔY}$-move
Huh, Youngsik
Nikkuni, Ryo
Combinatorics
Geometric Topology
05C62, 57M15, 05C10
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{Δ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{Δ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$.
title Crossing number of graphs and $\mathsf{ΔY}$-move
topic Combinatorics
Geometric Topology
05C62, 57M15, 05C10
url https://arxiv.org/abs/2402.10633