Covering graph conjecture for token graphs of odd stars

Let K1,nK_{1,n} be the star graph with nn leaves, let nn be odd, and set k=(n+1)/2k=(n+1)/2. A combined voltage assignment (α,ω)(\alpha,\omega) on a base graph XX with values in the group Z2n\mathbb{Z}_{2n} defines a covering graph X(α,ω)X^{(\alpha,\omega)}.

Covering conjecture for odd-star token graphs. The token graph Fk(K1,n)F_k(K_{1,n}) is isomorphic to a covering graph X(α,ω)X^{(\alpha,\omega)} of a base graph XX on

12n(2kk)\frac{1}{2n}\binom{2k}{k}

vertices, with combined assignment on the group Z2n\mathbb{Z}_{2n}.

The preceding discussion establishes the construction in particular cases, including n=3n=3 and n=5n=5, while the conjecture proposes it for every odd nn.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.