Chen–Wang conjecture on independence polynomials of clique-corona graphs
Let be the complete bipartite graph with parts of sizes and , and let denote its corona with . Write for the independence polynomial of a graph . Chen–Wang conjecture. For every , the polynomial is log-concave and therefore unimodal.
References
Status
- Solved: Yi Wang and Bao-Xuan Zhu. On the unimodality of independence polynomials of some graphs (arXiv, 2010) https://arxiv.org/abs/1008.2605
Source: Bao-Xuan Zhu, “Operations of graphs and unimodality of independence polynomials”, arXiv:1309.7673 (2013).
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.