The extremal incomparable-copy conjecture for the three-element poset V
Statement
Let denote the Boolean lattice of subsets of an -element set, and let be the three-element poset with elements and relations and . Let be the maximum number of pairwise incomparable copies of in . The construction described above consists of copies indexed by , with the th level contributing
copies. Extremal incomparable-copy conjecture. The maximum number of pairwise incomparable copies of in is
The displayed construction gives the lower bound, and the conjecture asserts that no larger collection of pairwise incomparable copies exists. The source provides no resolution, so the conjecture 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.