On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
From MaRDI portal
Publication:4187729
DOI10.1109/TIT.1979.1056027zbMath0402.94029OpenAlexW2044716089WikidataQ56030590 ScholiaQ56030590MaRDI QIDQ4187729
Publication date: 1979
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1979.1056027
Related Items
New lower bounds for the Shannon capacity of odd cycles ⋮ Capacities: From information theory to extremal set theory ⋮ On the subspace choosability in graphs ⋮ Faithful orthogonal representations of graphs from partition logics ⋮ A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming ⋮ Shannon capacity and the categorical product ⋮ A Bound on the Shannon Capacity via a Linear Programming Variation ⋮ On the independence numbers of the cubes of odd cycles ⋮ Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank ⋮ The zero-error capacity of binary channels with 2-memories ⋮ Entanglement can increase asymptotic rates of zero-error classical communication over classical channels ⋮ Graph Information Ratio ⋮ Approximation of the Shannon capacity via matrix cone programming ⋮ Improved incidence bounds over arbitrary finite fields via the VC-dimension theory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Normalized Shannon Capacity of a Union ⋮ New lower bound on the Shannon capacity of \(C_7\) from circular graphs ⋮ The minrank of random graphs ⋮ Topological Bounds for Graph Representations over Any Field ⋮ Independent sets in graphs ⋮ A new property of the Lovász number and duality relations between graph parameters ⋮ Linear Index Coding via Semidefinite Programming ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Applications of Ramsey theory ⋮ A limit theorem for the Shannon capacities of odd cycles I ⋮ A unified construction of semiring-homomorphic graph invariants ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior ⋮ The hat guessing number of graphs ⋮ Orthogonal representations over finite fields and the chromatic number of graphs ⋮ Unnamed Item ⋮ Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming ⋮ On the Shannon capacity of sums and products of graphs
