scientific article
From MaRDI portal
Publication:3931312
zbMath0474.94021MaRDI QIDQ3931312
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coding theorems (Shannon theory) (94A24)
Related Items (27)
UPPER BOUNDS FOR SUNFLOWER-FREE SETS ⋮ New lower bounds for the Shannon capacity of odd cycles ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ A Bound on the Shannon Capacity via a Linear Programming Variation ⋮ Ranks of matrices with few distinct entries ⋮ Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank ⋮ Local orthogonality dimension ⋮ Unnamed Item ⋮ Graph Information Ratio ⋮ Approximation of the Shannon capacity via matrix cone programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Research problems from the Aveiro workshop on graph spectra ⋮ Lovász, Vectors, Graphs and Codes ⋮ The minrank of random graphs ⋮ Sandwich theorems and capacity bounds for non-commutative graphs ⋮ A gap in the slice rank of \(k\)-tensors ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Polynomial time algorithm for min-ranks of graphs with simple tree structures ⋮ A limit theorem for the Shannon capacities of odd cycles I ⋮ Unnamed Item ⋮ The minrank of random graphs over arbitrary fields ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Topological bounds on the dimension of orthogonal representations of graphs ⋮ The hat guessing number of graphs ⋮ Unnamed Item
This page was built for publication:
