The Shannon capacity of a graph and the independence numbers of its powers

DOI10.1109/TIT.2006.872856zbMath1247.05167arXivcs/0608021OpenAlexW2166016569MaRDI QIDQ3546492

Eyal Lubetzky, Noga Alon

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0608021

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coding theorems (Shannon theory) (94A24)

Related Items (11)

Symmetric Shannon capacity is the independence number minus 1 ⋮ The zero-error capacity of binary channels with 2-memories ⋮ Graph Information Ratio ⋮ Approximation of the Shannon capacity via matrix cone programming ⋮ On the Normalized Shannon Capacity of a Union ⋮ Independent sets in graphs ⋮ On cover-structure graphs ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Dimension Reduction for Polynomials over Gaussian Space and Applications ⋮ On a diagonal conjecture for classical Ramsey numbers ⋮ On zero-error codes produced by greedy algorithms

This page was built for publication: The Shannon capacity of a graph and the independence numbers of its powers