20,916 research outputs found
Schrijver graphs and projective quadrangulations
In a recent paper [J. Combin. Theory Ser. B}, 113 (2015), pp. 1-17], the
authors have extended the concept of quadrangulation of a surface to higher
dimension, and showed that every quadrangulation of the -dimensional
projective space is at least -chromatic, unless it is bipartite.
They conjectured that for any integers and , the
Schrijver graph contains a spanning subgraph which is a
quadrangulation of . The purpose of this paper is to prove the
conjecture
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective
plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a
triangulation of P2 always exists if at least six points in S are in general
position, i.e., no three of them are collinear. We also design an algorithm for
triangulating P2 if this necessary condition holds. As far as we know, this is
the first computational result on the real projective plane
The Complexity of Finding Small Triangulations of Convex 3-Polytopes
The problem of finding a triangulation of a convex three-dimensional polytope
with few tetrahedra is proved to be NP-hard. We discuss other related
complexity results.Comment: 37 pages. An earlier version containing the sketch of the proof
appeared at the proceedings of SODA 200
- …