The Shannon capacity of a union

Cited In (38)

On the Shannon capacity of sums and products of graphs
Asymptotic values of the Hall-ratio for graph powers
Lovász, Vectors, Graphs and Codes
Constructive lower bounds for off-diagonal Ramsey numbers
Origins and genesis
Constructing Ramsey graphs from Boolean function representations
Title not available (Why is that?)
Graph Information Ratio
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
On the independence numbers of the cubes of odd cycles
Privileged users in zero-error transmission over a noisy channel
Title not available (Why is that?)
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
Title not available (Why is that?)
2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
When is a random graph projective?
Colouring strong products
Independent sets in graphs
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
Title not available (Why is that?)
Shannon capacity and the categorical product
Relative capacity and dimension of graphs
On the Normalized Shannon Capacity of a Union
A limit theorem for the Shannon capacities of odd cycles I
Explicit two-source extractors and resilient functions
Title not available (Why is that?)
Induced Ramsey-type theorems
Maximum privacy without coherence, zero-error
The zero-error capacity of binary channels with 2-memories
A combinatorial approach to nonlocality and contextuality
Local chromatic number and Sperner capacity
Symmetric Shannon capacity is the independence number minus 1
Reliable communication under the influence of a state-constrained jammer: an information-theoretic perspective on receive diversity
Topological bounds on the dimension of orthogonal representations of graphs
New lower bound on the Shannon capacity of \(C_7\) from circular graphs
Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
The minrank of random graphs over arbitrary fields
An Introduction to Randomness Extractors

This page was built for publication: The Shannon capacity of a union

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297763)