ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and G′G' be 33-connected graphs related by a twist along a minimal 44-vertex cut; minimality means that no proper subset of the four vertices already separates the graph.

Twist invariance conjecture. Then

N2(G)=N2(G′).\mathsf{N}_2(G)=\mathsf{N}_2(G').

Together with the proposed 3-sum formula, this would provide structural reductions for computing N2\mathsf{N}_2. The paper reports extensive computational evidence, but leaves the identity 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.