Extremal-value conjecture for irredundant families when n equals 2k minus 1
Statement
Let be the maximum size of an irredundant family of -dimensional subcubes of . Let be the centre vertex used in the source, and let be the family of all -subcubes through . For , extremal-value conjecture.
The conjectured extremal family is , 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 ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.