Set systems containing many maximal chains
From MaRDI portal
Publication:5364237
DOI10.1017/S0963548314000510zbMATH Open1371.05299arXiv1309.4643OpenAlexW2154182959MaRDI QIDQ5364237FDOQ5364237
Authors: J. Robert Johnson, Imre Leader, Paul A. Russell
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1309.4643
Recommendations
Cites Work
- Title not available (Why is that?)
- Most probably intersecting families of subsets
- Compressions and probably intersecting families
- Sperner's theorem and a problem of Erdős, Katona and Kleitman
- Title not available (Why is that?)
- The maximum number of disjoint pairs in a family of subsets
- Supersaturation in the Boolean lattice
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)