Abstract
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)$.
| Original language | English |
|---|---|
| Article number | 2303.00556 |
| Number of pages | 9 |
| Journal | arXiv |
| Volume | 2023 |
| DOIs | |
| Publication status | Published - 1 Mar 2023 |
Keywords
- math.CO
- cs.CG
Fingerprint
Dive into the research topics of 'A linear bound for the Colin de Verdiére parameter $μ$ for graphs embedded on surfaces'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver