Lexicode conjecture for clique covering numbers of Johnson graphs
Statement
Let be the Johnson graph whose vertices are the -subsets of a -element set, and let be the graph used in the construction above. Order the vertices of 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 lexicodehas cardinality
and its elements are pairwise overlapping. In particular, the code defines an independent set of cardinality in , so that
The construction is known computationally for . The conjecture would establish the stated clique-covering value for every that is a power of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.