Edge-count conjecture for minimal kinematics graphs
Statement
Let , and call a graph on a minimal kinematics graph when its edge set is inclusion-maximal among the graphs realizing minimal kinematics. Minimal kinematics edge-count conjecture. Every minimal kinematics graph on has edges. The conjecture is consistent with the authors' data and with the results cited as EPS; it extends the observed -tree examples, but remains unproved in the supplied text.
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.