ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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