The Minrank of Random Graphs
From MaRDI portal
Publication:4559572
DOI10.1109/TIT.2018.2810384zbMath1432.05095arXiv1607.04842OpenAlexW2963726605MaRDI QIDQ4559572
Omri Weinstein, Alexander Golovnev, Oded Regev
Publication date: 4 December 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04842
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Source coding (94A29)
Related Items (7)
The (minimum) rank of typical fooling-set matrices ⋮ Unnamed Item ⋮ Perfect and nearly perfect separation dimension of complete and random graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Orthonormal representations of \(H\)-free graphs ⋮ Unnamed Item
This page was built for publication: The Minrank of Random Graphs
