Stahl's real-negative-root conjecture for specified graph families
Stahl's real-negative-root conjecture for specified graph families
For each graph family listed in Example, let its genus polynomial be the polynomial whose coefficients count embeddings by genus. Stahl's conjecture. The zeros of the genus polynomials of the graphs listed in Example are real and negative. Stahl had verified the assertion for the linear families associated with items (i), (ii), and (iv), leaving the remaining listed families as conjectural cases.
Sources & referencesView supporting material
Primary source
Lily L. Liu and Yi Wang, “A unified approach to polynomial sequences with only real zeros”, arXiv:math/0509207 (2006).
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
Sign in to submit a solution.
No solutions have been posted yet.