2 research outputs found
Topological Bounds on the Dimension of Orthogonal Representations of Graphs
An orthogonal representation of a graph is an assignment of nonzero real
vectors to its vertices such that distinct non-adjacent vertices are assigned
to orthogonal vectors. We prove general lower bounds on the dimension of
orthogonal representations of graphs using the Borsuk-Ulam theorem from
algebraic topology. Our bounds strengthen the Kneser conjecture, proved by
Lov\'asz in 1978, and some of its extensions due to B\'ar\'any, Schrijver,
Dol'nikov, and Kriz. As applications, we determine the integrality gap of
fractional upper bounds on the Shannon capacity of graphs and the quantum
one-round communication complexity of certain promise equality problems.Comment: 18 page
Topological bounds for graph representations over any field
Haviv ({\em European Journal of Combinatorics}, 2019) has recently proved
that some topological lower bounds on the chromatic number of graphs are also
lower bounds on their orthogonality dimension over . We show that
this holds actually for all known topological lower bounds and all fields. We
also improve the topological bound he obtained for the minrank parameter over
-- an important graph invariant from coding theory -- and show
that this bound is actually valid for all fields as well. The notion of
independent representation over a matroid is introduced and used in a general
theorem having these results as corollaries. Related complexity results are
also discussed.Comment: 7 page