ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H(n,3)H(n,3) be the Hamming graph on Z3n{\mathbb Z}_3^n, and let U⊆Z3nU\subseteq {\mathbb Z}_3^n induce a subgraph of maximum degree 11. Write α(H(n,3))\alpha(H(n,3)) for the independence number of H(n,3)H(n,3).

Ansensio–García-Marco–Knauer conjecture. All such subsets satisfy

∣U∣=α(H(n,3))+O(1).|U|=\alpha(H(n,3))+O(1).

The paper proves several bounds under additional hypotheses, including ∣U∣≤α(H(n,3))+729|U|\leq \alpha(H(n,3))+729 when UU is ii-saturated for some i∈[n]i\in[n]. 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 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.