A Group-Theoretic Setting for Some Intersecting Sperner Families
From MaRDI portal
Publication:4291192
DOI10.1017/S0963548300000377zbMath0793.05137MaRDI QIDQ4291192
Walter Kern, Ulrich Faigle, Péter L. Erdős
Publication date: 10 August 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
partial orders; generalized Boolean algebras; intersecting Sperner families; Bollobás-type inequalities; Erdős-Ko-Rado-type results; intersecting affine subspaces
05D05: Extremal set theory
Related Items
The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, A sharp bound for the product of weights of cross-intersecting families, Erdős-Ko-Rado theorems of labeled sets, Intersecting antichains and shadows in linear lattices, On Chvàtal's conjecture and a conjecture on families of signed sets, Strongly intersecting integer partitions, Multiple cross-intersecting families of signed sets, On \(t\)-intersecting families of signed sets and permutations, The Erdős-Ko-Rado properties of various graphs containing singletons, The Erdős-Ko-Rado properties of set systems defined by double partitions, Pseudo-LYM inequalities and AZ identities, Compression and Erdős-Ko-Rado graphs, An Erdős-Ko-Rado theorem for restricted signed sets
Cites Work
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- More on the Erdős-Ko-Rado theorem for integer sequences
- On chains and Sperner k-families in ranked posets. II
- Intersection theorems for systems of finite vector spaces
- Sperner systems consisting of pairs of complementary subsets
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Maximal Families of Pairwise Disjoint Maximal Proper Chains in a Geometric Lattice
