The von Neumann neighborhood conjecture for graph codes
Statement
Let be the adjacency matrix of a graph on vertices with vertex set . Let be the binary linear code generated by , and let denote its minimum distance. For a nonempty subset of , let denote its von Neumann neighborhood. The von Neumann neighborhood conjecture. If
then either or . The observation preceding this conjecture verifies the claim for complete graphs, while its validity for general graphs is left 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.