On Some Problems of Lovász Concerning the Shannon Capacity of a Graph

Cited in

(43)

Capacities: From information theory to extremal set theory
New lower bound on the Shannon capacity of \(C_7\) from circular graphs
A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
A unified construction of semiring-homomorphic graph invariants
Probabilistic refinement of the asymptotic spectrum of graphs
On the Shannon capacity of sums and products of graphs
On the subspace choosability in graphs
Faithful orthogonal representations of graphs from partition logics
A combinatorial approach to nonlocality and contextuality
Applications of Ramsey theory
Analytical properties of Shannon's capacity of arbitrarily varying channels under list decoding: super-additivity and discontinuity behavior
New lower bounds for the Shannon capacity of odd cycles
Orthogonal representations over finite fields and the chromatic number of graphs
Shannon capacity and the categorical product
On the independence numbers of the cubes of odd cycles
Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
A limit theorem for the Shannon capacities of odd cycles I
A bound on the Shannon capacity via a linear programming variation
Graph information ratio
The minrank of random graphs
On minrank and the Lovász theta-function
On minrank and forbidden subgraphs
Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming
Independent sets in graphs
Topological bounds for graph representations over any field
A new property of the Lovász number and duality relations between graph parameters
On the normalized Shannon capacity of a union
Linear index coding via semidefinite programming
Linear index coding via semidefinite programming
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
The zero-error capacity of binary channels with 2-memories
Approximation of the Shannon capacity via matrix cone programming
Improved incidence bounds over arbitrary finite fields via the VC-dimension theory
Algebraic bounds for the independence and chromatic number of graph powers
The Sperner capacity of linear and nonlinear codes for the cyclic triangle
Inertia, independence and expanders
Semidefinite programming for discrete optimization and matrix completion problems
L-systems and the Lovász number
Unified bounds for the independence number of graphs
Asymptotic spectra: theory, applications, and extensions
On the ratio of Shannon numbers of graphs
Kernelization for H-coloring
The hat guessing number of graphs

This page was built for publication: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph

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