ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, and let δ\delta be the minimum vertex degree among all graphs in the LC orbit of GG. Suppose that there is no graph G′G' on nn vertices with

Q(G′,4)<Q(G,4).Q(G',4)<Q(G,4).

LC-orbit minimum-degree conjecture. Then there is no graph on nn vertices whose minimum vertex degree among all graphs in its LC orbit is greater than δ\delta. The statement proposes a relation between minimizing Q(G,4)Q(G,4) 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 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.