Conjectured dominion formula for cycles

From papers

Let GG be a cycle on n3n\ge 3 vertices. Its dominion is the invariant denoted by ζ(G)\zeta(G). Cycle dominion conjecture. If GG is a cycle on n3n\ge 3 vertices, then

ζ(G)={n2+5n6,if n1(mod3)n,if n2(mod3).\zeta(G)=\begin{cases} \frac{n^2+5n}{6}, & \text{if } n \equiv 1\pmod3 \\ n, & \text{if } n \equiv 2\pmod3. \end{cases}

The cases n1,2(mod3)n\equiv 1,2\pmod3 are presented as conjectural because the corresponding values are extrapolated from early recurring values using Lagrange interpolation; the case n0(mod3)n\equiv 0\pmod3 was established separately in the preceding argument.

Progress summary

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

Sources & referencesView supporting material

Primary source

Julian Allagan and Benkam Bobga, “Dominion of some graphs”, arXiv:2512.24115 (2025).

Solutions 0

No solutions have been posted yet.