Faudree–Favaron–Li conjecture on P_5-free irredundance perfect graphs
Statement
A graph is -free if it has no induced subgraph isomorphic to the path . Faudree–Favaron–Li conjecture. Any -free graph is irredundance perfect. Puech proved this consequence by showing that every graph containing neither nor a specified induced graph 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.