Bóna–Ju–Ann palindromicity conjecture for circular graph polytopes
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.
References
Primary source
Feihu Liu, “Proof of a conjecture on graph polytope”, arXiv:2409.11970 (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.