ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥5n\ge 5 with n≡0,5(mod6)n\equiv 0,5\pmod 6 and k=⌊(n+2)/6⌋k=\lfloor (n+2)/6\rfloor. Let Gn,kG_{n,k} be the graph from the paper, and let Gn,k‾∖v\overline{G_{n,k}}\setminus v denote the graph obtained by deleting any vertex vv from its complement. A minimal prime graph is a graph with the minimal-prime property defined in the paper.

Super-base graph conjecture. For every such nn and kk, if Gn,kG_{n,k} is a minimal prime graph, then Gn,k‾∖v\overline{G_{n,k}}\setminus v is not a minimal prime graph for any vertex vv; consequently, these graphs cannot be generated from any minimal prime graph.

Computations for n≤100n\le 100 support the claim. It asserts that the indicated minimal prime graphs are super base graphs, meaning that they are not generated from any minimal prime graph.

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.