ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let M(n,k)M(n,k) be the maximum size of an irredundant family of kk-dimensional subcubes of Qn={0,1}nQ_n=\{0,1\}^n. Let OO be the centre vertex used in the source, and let FO\mathcal F_O be the family of all kk-subcubes through OO. For n=2k−1n=2k-1, extremal-value conjecture.

M(2k−1,k)=(2k−1k).M(2k-1,k)={2k-1 \choose k}.

The conjectured extremal family is FO\mathcal F_O, whose size is the displayed binomial coefficient. This is the boundary case relevant to the Aharoni–Holzman problem, since a projection argument reduces the general conjecture to n=2k−1n=2k-1; the source presents the equality as conjectural.

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.