← All problems

Stahl's real-rootedness conjecture for graph genus polynomials

21 years old · traced to

Let GG be a graph, and let

ΓG(x)=∑k≥0gk(G)xk\Gamma_G(x)=\sum_{k\geq 0}g_k(G)x^k

be its genus polynomial, where gk(G)g_k(G) is the number of 2-cell embeddings of GG in an orientable surface of genus kk.

Stahl's real-rootedness conjecture. For every graph GG, the genus polynomial ΓG(x)\Gamma_G(x) 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

Source: MacKenzie Carr, Varpreet Dhaliwal and Bojan Mohar, “Genus Polynomials of Cubic Graphs with Non-Real Roots”, arXiv:2212.09971 (2026).

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.