On the capacity of Boolean graph formulæ (Q1805371)

The authors deal with some generalization of Shannon's graph capacity. They consider graphs or families of graphs as special formulae, the variables of which are pairs of vertices of their common vertex set. One of the interesting applications of the results are various forms of qualitative dependence on the maximum number of pairwise qualitative independent \(k\)-partitions on an \(n\)-set.