Covering graph conjecture for 2-token graphs of stars
Covering graph conjecture for 2-token graphs of stars
Let be the star graph with leaves. Suppose that divides . A combined voltage assignment on a base graph with values in the group defines a covering graph .
Covering conjecture for 2-token star graphs. The token graph is isomorphic to a covering graph of a base graph on vertices, with combined assignment on the group .
The conjecture summarizes the preceding examples and discussion for 2-token graphs of stars; no resolution is supplied in the source.
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.