Favaron's forbidden-subgraph conjecture for irredundance perfect graphs
Statement
Let be a graph, and let , , and be the graphs described in Figure 5 of the source. Favaron's conjecture. If does not contain , , or as induced subgraphs, then is irredundance perfect. The conjecture was later completely proved, and a stronger result is known using , , and instead; it 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.