The wheel-graph adjacency-polytope volume conjecture
The wheel-graph adjacency-polytope volume conjecture
Let be the wheel graph obtained by joining a single vertex to the cycle , and let denote the normalized volume of its type-PQ adjacency polytope. Wheel-graph volume conjecture. For all ,
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
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.