ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a hull be a graph arising as the hull of a set of transformations under the paper's construction, and let nn be its number of vertices. At-most-n−1n-1 generators conjecture. Every hull on nn vertices can be generated with at most n−1n-1 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 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.