Largest family without A ∪ B ⊆ C ∩ D
Journal of Combinatorial Theory Series A
Lower bounds for constant weight codes
IEEE Transactions on Information Theory
Note: l-trace k-Sperner families of sets
Journal of Combinatorial Theory Series A
On families of subsets with a forbidden subposet
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series A
Sperner type theorems with excluded subposets
Discrete Applied Mathematics
| Hi-index | 0.00 |
We survey results concerning the maximum size of a family F of subsets of an n-element set such that a certain configuration is avoided. When F avoids a chain of size two, this is just Sperner's theorem. Here we give bounds on how large F can be such that no four distinct sets A,B,C,D@?F satisfy A@?B, C@?B, C@?D. In this case, the maximum size satisfies (n@?n2@?)(1+1n+@W(1n^2))=