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

[学科分类] 离散数学和组合数学

[关键词] Graph theory;Geometric representation;Semidefinite programming