Explicit construction of exponential sized families of k-independent sets (Q1073031)

A collection F of subsets of \(\{\) 1,2,...,n\(\}\) is k-independent if for every k distinct members \(A_ 1,A_ 2,...,A_ k\) of F all \(2^ k\) intersections \(\cap^{k}_{j=1}B_ j\neq \emptyset\), where each \(B_ j\) can be either \(A_ j\) or its complement. In this note it is constructed for every fixed k a k-independent collection on n elements of size at least \(2^{c_ kn}\), where \(c_ k>0\) is independent of n. The existence of such a collection was proved by \textit{D. Kleitman} and \textit{J. Spencer} [Discrete Math. 6, 255-262 (1973; Zbl 0269.05002)].