Stability conjecture for independence polynomials of trees

About 9 years old · traced to

Let GG be a tree, and let i(G,x)i(G,x) 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 i(G,x)i(G,x) 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.

References

Primary source

Jason I. Brown and Ben Cameron, “On the Unimodality of Independence Polynomials of Very Well-Covered Graphs”, arXiv:1709.08236 (2017).

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.