Mynhardt–Roux path and cycle non-realisation conjecture for irredundance graphs
Statement
For a graph , an -graph is a graph realised as the slide graph of the irredundance sets of . Let and denote the path and cycle on vertices.
Mynhardt–Roux's conjecture. For every , is not an -graph, and for every , is not an -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.