@InProceedings{golovnev_et_al:LIPIcs.APPROX-RANDOM.2017.46, author = {Golovnev, Alexander and Regev, Oded and Weinstein, Omri}, title = {{The Minrank of Random Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-044-6}, ISSN = {1868-8969}, year = {2017}, volume = {81}, editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.46}, URN = {urn:nbn:de:0030-drops-75953}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.46}, annote = {Keywords: circuit complexity, index coding, information theory} }