ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G1G_1 and G2G_2 be two 33-connected graphs, each with a triangle Ti⊂GiT_i\subset G_i, and let G1⊕3G2G_1\oplus_3G_2 be a corresponding 3-sum. Define

pi=∣π0(Gi∖V(Ti))∣p_i=\left|\pi_0\left(G_i\setminus V(T_i)\right)\right|

to be the number of connected components remaining after deleting the triangle vertices.

3-sum conjecture. The invariant satisfies

N2(G1⊕3G2)=N2(G1)+N2(G2)−p1p2.\mathsf{N}_2(G_1\oplus_3G_2)=\mathsf{N}_2(G_1)+\mathsf{N}_2(G_2)-p_1p_2.

The formula would reduce computations of N2\mathsf{N}_2 to highly connected graphs and includes a star--triangle relation as a special case. The paper reports computational confirmation but no proof.

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.