A family of inequalities for intersecting antichains of subsets of an n-set
DOI10.1006/EUJC.1996.0007zbMATH Open0842.05093OpenAlexW2085375236MaRDI QIDQ1908275FDOQ1908275
Publication date: 18 March 1996
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0007
Recommendations
- Intersecting antichains and shadows in linear lattices
- Note on the Ahlswede-Daykin inequality
- Incomparability and intersection properties of Boolean interval lattices and chain posets
- A generalization of the ray‐chaudhuri‐wilson theorem
- Weighted cross-intersecting families
- Intersecting families in a subset of Boolean lattices
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- A new extension of Lubell's inequality to the lattice of divisors
- Minimum cutsets for an element of a Boolean lattice
- Minimum weight flat antichains of subsets
cyclic permutationBoolean latticeintersecting antichainsLYM-inequalityintersecting Sperner familiespair-intersecting family
Combinatorics of partially ordered sets (06A07) Combinatorial inequalities (05A20) Extremal set theory (05D05)
Cited In (7)
- Inequalities for two set systems with prescribed intersections
- Title not available (Why is that?)
- Reverse Kleitman Inequalities
- An identity in combinatorial extremal theory
- Title not available (Why is that?)
- Suboptimal \(s\)-union families and \(s\)-union antichains for vector spaces
- Erratum: Antichains in the set of subsets of a multiset
This page was built for publication: A family of inequalities for intersecting antichains of subsets of an \(n\)-set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908275)
