ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, an IR⁡\operatorname{IR}-graph is a graph realised as the slide graph of the irredundance sets of GG. Let PnP_n and CnC_n denote the path and cycle on nn vertices.

Mynhardt–Roux's conjecture. For every n≥3n\geq3, PnP_n is not an IR⁡\operatorname{IR}-graph, and for every n≥5n\geq5, CnC_n is not an IR⁡\operatorname{IR}-graph.

This conjecture concerns which graphs can arise from slide reconfiguration of irredundance sets. The cited work had already established several non-realisation results, including stars, certain short paths and cycles, and some smallest irredundance trees; the assertions for all paths and cycles in the stated ranges remain open in the supplied context.

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.