@InProceedings{haviv:LIPIcs.MFCS.2019.39,
author = {Haviv, Ishay},
title = {{Approximating the Orthogonality Dimension of Graphs and Hypergraphs}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.39},
URN = {urn:nbn:de:0030-drops-109836},
doi = {10.4230/LIPIcs.MFCS.2019.39},
annote = {Keywords: orthogonal representations of hypergraphs, orthogonality dimension, hardness of approximation, Kneser and Schrijver graphs, semidefinite programming}
}