Clique-root conjecture for l-connected chordal K(l+3)-free graphs

About 5 years old · traced to

Let ll be a positive integer, and let GG be an ll-connected chordal graph. Let Kl+3K_{l+3} denote the complete graph on l+3l+3 vertices. A clique root is a real root of the clique polynomial C(G,x)C(G,x).

Clique-root conjecture. If GG is Kl+3K_{l+3}-free, then GG has only clique roots.

This is presented as a stronger conjecture extending the preceding claims for restricted connectivity and clique-exclusion classes. The source does not state whether it has been resolved.

References

Primary source

Hossein Teimoori Faal, “Sums of Polynomials and Clique Roots”, arXiv:2112.09744 (2021).

Additional references

2 papers in this index state this conjecture (2021). The statement above is taken from the most recent of them; the others are arXiv:2112.09721.

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.