Enregistré dans:
Détails bibliographiques
Auteurs principaux: Toledo, Micael, Ramos, Alejandra, Potocnik, Primoz, Wilson, Stephen
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2503.14241
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908273616093184
author Toledo, Micael
Ramos, Alejandra
Potocnik, Primoz
Wilson, Stephen
author_facet Toledo, Micael
Ramos, Alejandra
Potocnik, Primoz
Wilson, Stephen
contents In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a dart-transitive graph of valence q, there are exactly q-1 orbits of consistent cycles. These ideas have become a useful tool in the area of graphs symmetries, and generalize easily to consistent walks in graphs which are not simple. These walks are not necessarily cycles, or even circuits. This paper considers these walks and their orbits in the venue of dart-transitive maps and classifies them geometrically.
format Preprint
id arxiv_https___arxiv_org_abs_2503_14241
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Orbits of consistent walk in dart-transitive maps
Toledo, Micael
Ramos, Alejandra
Potocnik, Primoz
Wilson, Stephen
Combinatorics
In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a dart-transitive graph of valence q, there are exactly q-1 orbits of consistent cycles. These ideas have become a useful tool in the area of graphs symmetries, and generalize easily to consistent walks in graphs which are not simple. These walks are not necessarily cycles, or even circuits. This paper considers these walks and their orbits in the venue of dart-transitive maps and classifies them geometrically.
title Orbits of consistent walk in dart-transitive maps
topic Combinatorics
url https://arxiv.org/abs/2503.14241