Crossing number of graphs and Y-move
Abstract
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 Y-move, on the complete graph Kn. Concretely it is shown that for any k∈ N, there exist a natural number n and a sequence of Y-moves Kn→ G(1)→ ·s → G(k) which is decreasing with respect to the crossing number. We also discuss the decrease of crossing number for relatively small n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.