The following pages link to (Q204150):
Displaying 50 items.
- Enumeration of lattice 3-polytopes by their number of lattice points (Q161308) (← links)
- Lattice 3-polytopes with six lattice points (Q161309) (← links)
- Lattice 3-polytopes with few lattice points (Q161310) (← links)
- Non-spanning lattice 3-polytopes (Q161312) (← links)
- (Q232990) (redirect page) (← links)
- Many triangulated odd-dimensional spheres (Q261399) (← links)
- (Q384505) (redirect page) (← links)
- Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384506) (← links)
- Rejoinder on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q384508) (← links)
- (Q411411) (redirect page) (← links)
- Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids (Q411413) (← links)
- The brick polytope of a sorting network (Q412257) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- (Q510559) (redirect page) (← links)
- Enumerating lattice 3-polytopes (Q510560) (← links)
- (Q588565) (redirect page) (← links)
- An update on the Hirsch conjecture (Q613104) (← links)
- Inscribing a symmetric body in an ellipse (Q671595) (← links)
- On the number of facets of three-dimensional Dirichlet stereohedra. IV: Quarter cubic groups (Q717823) (← links)
- Erratum to: ``The Gromov norm of the product of two surfaces'' (Q837650) (← links)
- Combinatorial pseudo-triangulations (Q864146) (← links)
- Lattice Delone simplices with super-exponential volume (Q872037) (← links)
- On the number of facets of three-dimensional Dirichlet stereohedra. III: Full cubic groups (Q958217) (← links)
- Triangulations. Structures for algorithms and applications (Q986135) (← links)
- Lattice points in Minkowski sums (Q1010664) (← links)
- Multitriangulations as complexes of star polygons (Q1017914) (← links)
- Triple-loop networks with arbitrarily many minimum distance diagrams (Q1024484) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- The number of geometric bistellar neighbors of a triangulation (Q1283745) (← links)
- The number of triangulations of the cyclic polytope \(C(n,n-4)\) (Q1349285) (← links)
- Higher Lawrence configurations. (Q1399915) (← links)
- Asymptotically efficient triangulations of the \(d\)-cube (Q1422223) (← links)
- The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected (Q1569851) (← links)
- The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings (Q1572873) (← links)
- On the topology of the Baues poset of polyhedral subdivisions (Q1599621) (← links)
- Hirsch polytopes with exponentially long combinatorial segments (Q1675265) (← links)
- Classification of empty lattice 4-simplices of width larger than 2 (Q1689988) (← links)
- Non-crossing frameworks with non-crossing reciprocals (Q1764166) (← links)
- The Gromov norm of the product of two surfaces (Q1767609) (← links)
- The polytope of non-crossing graphs on a planar point set (Q1772132) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
- An effective version of Pólya's theorem on positive definite forms (Q1917390) (← links)
- The polytope of all triangulations of a point configuration (Q1917625) (← links)
- On Delaunay oriented matroids for convex distance functions (Q1923774) (← links)
- Polytopality and Cartesian products of graphs (Q1932654) (← links)
- Triangulations with very few geometric bistellar neighbors (Q1961849) (← links)
- Fiber polytopes for the projections between cyclic polytopes (Q1964647) (← links)
- The generalized Baues problem for cyclic polytopes. I (Q1964649) (← links)
- A local maximizer for lattice width of 3-dimensional hollow bodies (Q2028093) (← links)