We present a conjecture about the maximal cardinalities and prove it in several cases. More generally cardinalities are replaced by weights and asymptotic ...

The t-intersection problem in the truncated Boolean lattice. 475. Now choose r := bn. 1. 4 c. From (3) it follows that k−i. X j=0 n − t − 2r j. ∼ 8(2c)2n−t−2r.

i.e. the class of t{intersecting families whose members have size equal to k resp. not greater than k, and let I k(n; t), C k(n; s), C k(n; s) be defined.

We present a conjecture about the maximal cardinalities and prove it in several cases.More generally cardinalities are replaced by weights and asymptotic ...

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, I ≤ k(n, t) = I(n, t) ∩ 2.

Let I(n, t) be the class of all t-intersecting families of subsets of [n] and set I-k(n, t) = I(n, t) boolean AND 2(([n])(k)), I-less than or equal tok(n, ...

Engel and L. Khachatrian, “The t-intersection problem in the truncated boolean lattice”, submitted to European Journal of Combina-tories. Google Scholar.

The t-intersection problem in the truncated boolean lattice. R Ahlswede, C Bey, K Engel, LH Khachatrian. European Journal of Combinatorics 23 (5), 471-487, 2002.

Jun 10, 2024 · The t-intersection Problem in the Truncated Boolean Lattice. Eur. J ... The Complete Intersection Theorem for Systems of Finite Sets.