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ős and Lovász, are closely related to orthonormal representations of triangle-free graphs, in particular to their Lová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án number of and the maximum of over all -free graphs .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.