加载中…
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 $\vartheta \left( \overline{G} \right)HG$.

生成讲解博客的中文版本

生成AI智能校验的中文版本