ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,2,…,n}[n]=\{1,2,\dots,n\}, and call a graph on [n][n] 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 [n][n] has 3n−63n-6 edges. The conjecture is consistent with the authors' data and with the results cited as EPS; it extends the observed 22-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 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.