The 3-sum formula for Speyer's invariant

About 1 year old · traced to

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.

References

Primary source

Erik Panzer, “Graph theoretic properties of Speyer's matroid polynomial g_M(t)”, arXiv:2506.18788 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.