LC-orbit minimum-degree conjecture for the interlace polynomial Q
Statement
Let be a graph on vertices, and let be the minimum vertex degree among all graphs in the LC orbit of . Suppose that there is no graph on vertices with
LC-orbit minimum-degree conjecture. Then there is no graph on vertices whose minimum vertex degree among all graphs in its LC orbit is greater than . The statement proposes a relation between minimizing and maximizing the minimum degree within a local-complementation orbit; the paper presents it as an open conjecture supported by the computational data in its tables.
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.