The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected

DOI10.1007/s004540010013zbMath0956.05063OpenAlexW1967167259MaRDI QIDQ1569851

Francisco Santos, Miguel Azaola

Publication date: 4 March 2001

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010013

zbMATH Keywords

triangulationmatroidpoint configurationbistellar flipvirtual chamberpseudo-chamber complex

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (2)

Lifting simplicial complexes to the boundary of convex polytopes ⋮ Projections of polytopes on the plane and the generalized Baues problem

This page was built for publication: The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected