Stability conjecture for independence polynomials of trees
Stability conjecture for independence polynomials of trees
Let be a tree, and let denote its independence polynomial. A polynomial is stable here when all of its roots lie in the left half-plane. Tree stability conjecture. The independence polynomial is stable; equivalently, all of its roots lie in the left half-plane. The source reports that the authors found no independence root of a tree in the right half-plane, but supplies no proof or resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jason I. Brown and Ben Cameron, “On the Unimodality of Independence Polynomials of Very Well-Covered Graphs”, arXiv:1709.08236 (2017).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.