ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P5P_5 denote the chordless path on five vertices. A graph is perfectly divisible if every induced subgraph with at least one edge has a partition (A,B)(A,B) such that the induced graph on AA is perfect and (G[B])<(G)(G[B])<(G).

P5-free conjecture. Every P5P_5-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 (P5,bull⁡)(P_5,\operatorname{bull})-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 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.