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 Edit this on Wikidata


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 (n+1)-element chains in the power set mathcalP(1,2,dots,n)? We will show that for each fixed alpha>0 there is a family of alpha2n sets containing (alpha+o(1))n! 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


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)