The at-most-n-minus-one generators conjecture for hulls
Statement
Let a hull be a graph arising as the hull of a set of transformations under the paper's construction, and let be its number of vertices. At-most- generators conjecture. Every hull on vertices can be generated with at most transformations. The conjecture concerns the maximum possible size of a minimal generating set for hulls. The paper reports that the computational data support the bound, but no proof is known.
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.