Covering graph conjecture for token graphs of odd stars
Covering graph conjecture for token graphs of odd stars
Let be the star graph with leaves, let be odd, and set . A combined voltage assignment on a base graph with values in the group defines a covering graph .
Covering conjecture for odd-star token graphs. The token graph is isomorphic to a covering graph of a base graph on
vertices, with combined assignment on the group .
The preceding discussion establishes the construction in particular cases, including and , while the conjecture proposes it for every odd .
Sources & referencesView supporting material
Primary source
Sergio G. Gómez-Galicia and Octavio B. Zapata-Fonseca, “Edge-transitive token graphs as covers”, arXiv:2505.20632 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.