On the capacity of Boolean graph formulæ (Q1805371)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the capacity of Boolean graph formulæ |
scientific article |
Statements
On the capacity of Boolean graph formulæ (English)
0 references
11 September 1995
0 references
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.
0 references
Shannon capacity
0 references
Boolean formulae
0 references
graph capacity
0 references