Clique-root conjecture for l-connected chordal K(l+3)-free graphs
Statement
Let be a positive integer, and let be an -connected chordal graph. Let denote the complete graph on vertices. A clique root is a real root of the clique polynomial .
Clique-root conjecture. If is -free, then 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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.