Chain-dependent Conditions in Extremal Set Theory

MaRDI QIDQ6387919zbMATH OpenFDO

Authors Dániel T. Nagy, Kartal Nagy

Publication date 10 January 2022

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for its intersections with the $n!$ full chains. We introduce a method to handle problems with such conditions, then show how it can be used to prove three classic theorems. Then, a theorem about families containing no two sets such that $AsubsetB$ and $lambdacdot|A|le|B|$ is proved. Finally, we investigate problems where instead of the size of the family, the number of $ell$-chains is maximized. Our method is to define a weight function on the sets (or $ell$-chains) and use it in a double counting argument involving full chains.

This page was built for publication: Chain-dependent Conditions in Extremal Set Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6387919)