Li et al.'s log-concavity conjecture for Clar covering polynomials
Let be a hexagonal system, meaning a 2-connected finite plane graph whose interior faces are regular hexagons of side length one. Let be the Clar covering polynomial of .
Li et al.'s conjecture. The polynomial is log-concave.
Since the coefficients of are positive, this is stronger than the unimodality conjecture for Clar covering polynomials. The conjecture was proposed after extensive numerical testing and remains open in the supplied source.
References
Primary source
Yan-Ting Xie, Yong-De Feng and Shou-Jun Xu, “A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs”, arXiv:2303.14671 (2024).
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
No solutions have been posted yet.