Optimization Problems over Unit-Distance Representations of Graphs
We study the relationship between unit-distance representations and the Lovász theta number of graphs, originally established by Lovász. We derive and prove min-max theorems. This framework allows us to derive a weighted version of the hypersphere number of a graph and a related min-max theorem. Then, we connect to sandwich theorems via graph homomorphisms. We present and study a generalization of the hypersphere number of a graph and the related optimization problems. The generalized problem involves finding the smallest ellipsoid of a given shape which contains a unit-distance representation of the graph. Arbitrary positive semidefinite forms describing the ellipsoids yield NP-hard problems.