The wheel-graph adjacency-polytope volume conjecture

Let WN=K1CNW_N=K_1\vee C_N be the wheel graph obtained by joining a single vertex to the cycle CNC_N, and let NVol(WNPQ)\operatorname{NVol}(\nabla^{\operatorname{PQ}}_{W_N}) denote the normalized volume of its type-PQ adjacency polytope. Wheel-graph volume conjecture. For all N3N\geq 3,

NVol(WNPQ)=3N2N+1.\operatorname{NVol}(\nabla^{\operatorname{PQ}}_{W_N})=3^N-2^N+1.

This gives a conjectural closed formula for the normalized volumes of wheel graphs, a planar class that is not generally outerplanar. The source provides no proof or resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Robert Davis and Tianran Chen, “Computing Volumes of Adjacency Polytopes via Draconian Sequences”, arXiv:2007.11051 (2022).

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.