Perfect-matching minimum-action conjecture for complete graphs
Statement
Let be a complete graph with an even number of vertices, and let the action be the sum of the edge curvatures. A perfect-matching minimum-action conjecture states that the minimum action for is achieved by the perfect-matching setting, in which the action is , the number of vertices. This is proposed in analogy with the tree case, while the preceding theorem establishes the maximum action for the constant edge-length setting.
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.