Ansensio–García-Marco–Knauer conjecture on induced degree-one subsets of the ternary Hamming graph
Statement
Let be the Hamming graph on , and let induce a subgraph of maximum degree . Write for the independence number of .
Ansensio–García-Marco–Knauer conjecture. All such subsets satisfy
The paper proves several bounds under additional hypotheses, including when is -saturated for some . The conjecture asks whether a bounded additive error remains valid without any saturation assumption; this 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.