A linear bound for the Colin de Verdi\`ere parameter μ for graphs embedded on surfaces
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 μ(G) is upper bounded by 7-2(S).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.