A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
For any undirected graph $G$, let $\mu (G)$ be the graph parameter introduced by Colin de Verdière. In this paper we show that $\mu (G)\leq 4$ if and only if $G$ is linklessly embeddable (in $\mathbb {R}^3$). This forms a spectral characterization of linklessly embeddable graphs, and was conjectured by …