How is a graph like a manifold?

Simple item page
dc.creatorBolker, Ethan
dc.creatorGuillemin, Victor
dc.creatorHolm, Tara
dc.date2002-06-10
dc.date.accessioned2026-07-07T04:49:02Z
dc.date.available2026-07-07T04:49:02Z
dc.descriptionIn this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty years ago by Richard Stanley by interpreting certain combinatorial invariants of convex polytopes as the Betti numbers of a complex projective variety. Another example is the classical parallel redrawing problem, which turns out to be closely related to the problem of computing the second Betti number of a complex compact $(\C^*)^n$-manifold.
dc.description36 pages, 17 figures
dc.identifierhttps://arxiv.org/abs/math/0206103
dc.identifierhttp://arxiv.org/abs/math/0206103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64272
dc.subjectCombinatorics
dc.subject05C99
dc.titleHow is a graph like a manifold?
dc.typetext

Files

Collections

arXiv