ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Dk,noddD^{odd}_{k,n} and Dk,nevenD^{even}_{k,n} denote the odd- and even-parity D(k)D(k) graphs constructed in the paper, with order parameter nn.

Minimum-order conjecture. For all k≥3k\geq 3, there exists no Dk,noddD^{odd}_{k,n} for all n<4k−3n < 4k-3 and Dk,nevenD^{even}_{k,n} for all n<3kn < 3k.

The authors construct such graphs for all n≥4k−3n\geq 4k-3 in the odd case and all n≥3kn\geq 3k in the even case, and conjecture that these orders are minimal. The claim remains open.

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.