An Erdo¨s-Ko-Rado theorem for integer sequences of given rank
European Journal of Combinatorics
Handbook of combinatorics (vol. 2)
Sperner theory
The complete intersection theorem for systems of finite sets
European Journal of Combinatorics
Regular Article: The Diametric Theorem in Hamming Spaces驴Optimal Anticodes
Advances in Applied Mathematics
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
Let I(n, t) be the class of all t-intersecting families of subsets of [n] and set Ik(n, t) = I(n, t) ∩ 2([n] k), I≤k(n,t) =I(n,t) ∩ 2([n] k).After the maximal families in I(n, t) [13] and in Ik(n, t) [1,9] are known we study now maximal families in I≤k(n,t). We present a conjecture about the maximal cardinalities and prove it in several cases.More generally cardinalities are replaced by weights and asymptotic estimates are given. Analogous investigations are made for I(n,t) ∩ C(n,s), where C(n,s) is the class of all s-cointersecting families of subsets of [n]. In particular we establish an asymptotic form of a conjecture by Bang et al. [4].