The 3-sum formula for Speyer's invariant
Statement
Let and be two -connected graphs, each with a triangle , and let be a corresponding 3-sum. Define
to be the number of connected components remaining after deleting the triangle vertices.
3-sum conjecture. The invariant satisfies
The formula would reduce computations of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.