The deck characterization of switching equivalence
Statement
Let and be graphs on vertices, and let denote the deck of vertex-deleted subgraphs of . The decks are switching equivalent when there is a bijection between their cards that maps each card to a switching-equivalent graph. The deck characterization conjecture. The graphs and are switching equivalent if and only if
This is presented as an equivalent reformulation of the switching-equivalent reconstruction conjecture and is computationally verified in the supplied source for representatives with vertices; the general statement is left open.
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.