ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let J(2k,k−1)J(2k,k-1) be the Johnson graph whose vertices are the (k−1)(k-1)-subsets of a 2k2k-element set, and let JK(2k,k−1)JK(2k,k-1) be the graph used in the construction above. Order the vertices of J(2k,k−1)J(2k,k-1) lexicographically and apply the greedy algorithm to obtain a lexicode

in $J(2k,k-1)$. Let $C_k$ denote the corresponding benchmark cardinality. **Lexicode conjecture.** Assume that $k>1$ is a power of $2$. The lexicode

has cardinality

∣∣=12Ck,||=\tfrac{1}{2}C_k,

and its elements are pairwise overlapping. In particular, the code defines an independent set of cardinality CkC_k in JK(2k,k−1)JK(2k,k-1), so that

θ(J(2k,k))=Ck.\theta(J(2k,k))=C_k.

The construction is known computationally for k=2,4,8,16k=2,4,8,16. The conjecture would establish the stated clique-covering value for every k>1k>1 that is a power of 22.

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.