ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.