On Maps with a Single Zigzag
Sostenes Lins, Valdenberg Silva
Abstract
If a graph GM is embedded into a closed surface S such that S GM is a collection of disjoint open discs, then M=(GM,S) is called a map. A zigzag in a map M is a closed path which alternates choosing, at each star of a vertex, the leftmost and the rightmost possibilities for its next edge. If a map has a single zigzag we show that the cyclic ordering of the edges along it induces linear transformations, cP and cP whose images and kernels are respectively the cycle and bond spaces (over GF(2)) of GM and GD, where D=(GD,S) is the dual map of M. We prove that Im(cP cP) is the intersection of the cycle spaces of GM and GD, and that the dimension of this subspace is connectivity of S. Finally, if M has also a single face, this face induces a linear transformation cD which is invertible: we show that cD-1 = cP.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.