Two-part set systems
From MaRDI portal
Abstract: The two part Sperner theorem of Katona and Kleitman states that if is an -element set with partition , and is a family of subsets of such that no two sets satisfy (or ) and for some , then . We consider variations of this problem by replacing the Sperner property with the intersection property and considering families that satisfiy various combinations of these properties on one or both parts , . Along the way, we prove the following new result which may be of independent interest: let be families of subsets of an -element set such that and are both intersecting and cross-Sperner, meaning that if and , then and . Then and there are exponentially many examples showing that this bound is tight.
Recommendations
Cited in
(8)- Improved bounds for cross-Sperner systems
- Even and odd pairs of lattice paths with multiple intersections
- A Sperner-type theorem for set-partition systems
- Clique number of Xor products of Kneser graphs
- Systems of sets of lengths. II
- Sperner partition systems
- All Maximum Size Two-Part Sperner Systems: In Short
- All maximum 2-part Sperner families
This page was built for publication: Two-part set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426823)