We provide a combinatorial and self-contained proof that for all graphs $G$ embedded on a surface $S$, the Colin de Verdi\`ere parameter $\mu(G)$ is upper bounded by $7-2\chi(S)$.
翻译:我们提供了一组和自足的证据,证明对嵌入表面的所有图表来说,Colin de Verdi<unk> ere 参数$\mu(G) 由7-2\chi(S) 美元构成。</s>