ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X1X_1 and X2X_2 be graphs on nn vertices, and let D(Xi)\mathcal{D}(X_i) denote the deck of vertex-deleted subgraphs of XiX_i. 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 X1X_1 and X2X_2 are switching equivalent if and only if

D(X1)∼D(X2).\mathcal{D}(X_1) \sim \mathcal{D}(X_2).

This is presented as an equivalent reformulation of the switching-equivalent reconstruction conjecture and is computationally verified in the supplied source for representatives with 4≤n≤104\leq n\leq 10 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 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.