Bóna–Ju–Ann palindromicity conjecture for circular graph polytopes
Bóna–Ju–Ann palindromicity conjecture for circular graph polytopes
From papers
Let have vertex set and edge set consisting of all pairs , with identified with ; such a graph is called a circular graph. Let .
Bóna–Ju–Ann conjecture. If , then
is a polynomial in of degree with symmetric coefficients. If , then
is a polynomial in of degree with symmetric coefficients.
The source states that this conjecture is confirmed using a result from another paper, so it is solved.
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
Feihu Liu, “Proof of a conjecture on graph polytope”, arXiv:2409.11970 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.