ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is P5P_5-free if it has no induced subgraph isomorphic to the path P5P_5. Faudree–Favaron–Li conjecture. Any P5P_5-free graph is irredundance perfect. Puech proved this consequence by showing that every graph containing neither P6P_6 nor a specified induced graph HH is irredundance perfect; the conjecture is therefore solved.

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.