Füredi's equi-sized chain partition conjecture for the Boolean lattice
Statement
Let denote the Boolean lattice of subsets of , and let a chain be a subset whose elements are pairwise comparable by inclusion. For a positive integer , set
Füredi's conjecture. For every positive integer , the Boolean lattice can be partitioned into chains such that the size of each chain is or .
If true, this would give a partition into chains of size . The conjecture remains open; a weaker result gives a partition into the same number of chains whose sizes lie between and .
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.