Orthonormal representations of $H$-free graphs
Combinatorics
2020-01-24 v2
Abstract
Let be unit vectors such that among any three there is an orthogonal pair. How large can be as a function of , and how large can the length of be? The answers to these two celebrated questions, asked by Erd\H{o}s and Lov\'{a}sz, are closely related to orthonormal representations of triangle-free graphs, in particular to their Lov\'{a}sz -function and minimum semidefinite rank. In this paper, we study these parameters for general -free graphs. In particular, we show that for certain bipartite graphs , there is a connection between the Tur\'{a}n number of and the maximum of over all -free graphs .
Keywords
Cite
@article{arxiv.1905.01539,
title = {Orthonormal representations of $H$-free graphs},
author = {Igor Balla and Shoham Letzter and Benny Sudakov},
journal= {arXiv preprint arXiv:1905.01539},
year = {2020}
}
Comments
16 pages