The P5-free perfect divisibility conjecture
Statement
Let denote the chordless path on five vertices. A graph is perfectly divisible if every induced subgraph with at least one edge has a partition such that the induced graph on is perfect and .
P5-free conjecture. Every -free graph is perfectly divisible.
The conjecture is proposed in connection with the paper's clique-cutset results. Chudnovsky and Sivaraman proved the related result that -free graphs are perfectly divisible; the stated conjecture remains open.
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.