On the capacity of Boolean graph formulæ
From MaRDI portal
Publication:1805371
DOI10.1007/BF01787419zbMath0820.94013MaRDI QIDQ1805371
Luisa Gargano, János Körner, Ugo Vaccaro
Publication date: 11 September 1995
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle
- Entropy splitting for antiblocking corners and perfect graphs
- On qualitatively independent partitions and related problems
- Explicit construction of exponential sized families of k-independent sets
- On the maximum number of qualitative independent partitions
- A Sperner-type theorem and qualitative independence
- Qualitative independence and Sperner problems for directed graphs
- On the ratio of optimal integral and fractional covers
- On the Shannon capacity of probabilistic graphs
- Capacities: From information theory to extremal set theory
- Two combinatorial covering theorems
- Intersection number and capacities of graphs
- Sperner capacities
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Graphs that Split Entropies
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Fredman–Komlós bounds and information theory
- Vector sets for exhaustive testing of logic circuits
- On the Shannon capacity of a graph
- Inequalities: theory of majorization and its applications
This page was built for publication: On the capacity of Boolean graph formulæ
