scientific article; zbMATH DE number 3745081

Cited in

(33)

Ranks of matrices with few distinct entries
Sandwich theorems and capacity bounds for non-commutative graphs
A gap in the slice rank of $k$-tensors
Probabilistic refinement of the asymptotic spectrum of graphs
A combinatorial approach to nonlocality and contextuality
Polynomial time algorithm for min-ranks of graphs with simple tree structures
The minrank of random graphs over arbitrary fields
Topological bounds on the dimension of orthogonal representations of graphs
New lower bounds for the Shannon capacity of odd cycles
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Research problems from the Aveiro workshop on graph spectra
Lovász, vectors, graphs and codes
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
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
Approximating the orthogonality dimension of graphs and hypergraphs
UPPER BOUNDS FOR SUNFLOWER-FREE SETS
Linear index coding via semidefinite programming
Approximating the orthogonality dimension of graphs and hypergraphs
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
Local orthogonality dimension
Approximation of the Shannon capacity via matrix cone programming
Chordal graphs and distinguishability of quantum product states
Inertia, independence and expanders
Spectral Pseudorandomness and the Road to Improved Clique Number Bounds for Paley Graphs
Nearly orthogonal sets over finite fields
Kernels for storage capacity and dual index coding
L-systems and the Lovász number
The hat guessing number of graphs

This page was built for publication:

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