Stahl's real-rootedness conjecture for graph genus polynomials
Let be a graph, and let
be its genus polynomial, where is the number of 2-cell embeddings of in an orientable surface of genus .
Stahl's real-rootedness conjecture. For every graph , the genus polynomial has only real roots.
The conjecture was proposed by Stahl as a stronger property than log-concavity of the genus distribution. It was later disproved; the paper discusses counterexamples among graph genus polynomials, although it also notes an error in one previously proposed counterexample.
References
2 papers in this index state this conjecture (2005–2022). The statement above is taken from the most recent of them; the others are arXiv:math/0509207.
Status
- Refuted: Yichao Chen and Yanpei Liu. On a Conjecture of S. Stahl (Canadian Journal of Mathematics, 2010) https://www.cambridge.org/core/journals/canadian-journal-of-mathematics/article/on-a-conjecture-of-s-stahl/4BECC57718C1AF9102554A0BCD21B240
Source: MacKenzie Carr, Varpreet Dhaliwal and Bojan Mohar, “Genus Polynomials of Cubic Graphs with Non-Real Roots”, arXiv:2212.09971 (2026).
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
No solutions have been posted yet.