Pandey parity conjecture for generalized Petersen graphs
Let be the generalized Petersen graph, and let denote its independence polynomial. For all integers , Parity Conjecture. the polynomial has only real roots if and only if is even. The conjecture is motivated by computations showing exclusively real negative roots for even and complex conjugate root structures for odd ; a proof of the parity dichotomy is not provided.
Equivalent formulations 1Other wordings
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Pandey parity conjecture for generalized Petersen graphs
For every , is the independence polynomial of real-rooted if and only if is even?
References
Primary source
Rohan Pandey, “Parity-Dependent Real-Rootedness in Independence Polynomials of Generalized Petersen Graphs”, arXiv:2601.03293 (2026).
Progress summary
A recent computation supports the parity pattern, but no proof or counterexample has been found.
The conjecture asks whether is real-rooted exactly for even , for every . It was formulated in a computational study of generalized Petersen graphs; no proposer or publication date is specified in the retrieved material.
Computational evidence
An exact transfer-matrix computation tested and values of up to . Odd produced nonreal conjugate roots, while even produced apparently strictly negative real roots; the authors explicitly state that finite computation and numerical root-finding provide no proof or counterexample.
Current status (as of March 2026): The conjecture has computational support for tested cases, but remains completely open for general and .
Solutions 0
No solutions have been posted yet.