Set systems containing many maximal chains
From MaRDI portal
Publication:5364237
Abstract: The purpose of this short problem paper is to raise an extremal question on set systems which seems to be natural and appealing. Our question is: which set systems of a given size maximise the number of -element chains in the power set ? We will show that for each fixed there is a family of sets containing such chains, and that this is asymptotically best possible. For smaller set systems we are unable to answer the question. We conjecture that a `tower of cubes' construction is extremal. We finish by mentioning briefly a connection to an extremal problem on posets and a variant of our question for the grid graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 3256524 (Why is no real title available?)
- Compressions and probably intersecting families
- Most probably intersecting families of subsets
- Sperner's theorem and a problem of Erdős, Katona and Kleitman
- Supersaturation in the Boolean lattice
- The maximum number of disjoint pairs in a family of subsets
Cited in
(2)
This page was built for publication: Set systems containing many maximal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364237)