Topological finiteness for edge-vertex enumeration

DOI10.1016/j.aim.2008.07.010zbMath1167.52014OpenAlexW2076295993MaRDI QIDQ952417

Ed Swartz

Publication date: 12 November 2008

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2008.07.010

zbMATH Keywords

\(f\)-vectorcombinatorial manifolds\(g_2\)

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Triangulating manifolds (57Q15) Polyhedral manifolds (52B70)

Related Items (max. 100)

A characterization of homology manifolds with \(g_{2}\geq 2\) ⋮ A characterization of simplicial polytopes with \(g_{2}=1\) ⋮ A characterization of normal 3-pseudomanifolds with at most two singularities ⋮ A lower bound theorem for centrally symmetric simplicial polytopes ⋮ LOWER BOUND THEOREMS AND A GENERALIZED LOWER BOUND CONJECTURE FOR BALANCED SIMPLICIAL COMPLEXES ⋮ Three-dimensional normal pseudomanifolds with relatively few edges

Cites Work

• Unnamed Item
• Unnamed Item
• Rigidity and the lower bound theorem. I
• Higherdimensional analogues of Császár's torus
• Minimal triangulations of sphere bundles over the circle
• Socles of Buchsbaum modules, complexes and posets
• On the number of faces of simplicial complexes and the purity of Frobenius
• Manifolds with few vertices
• Combinatorial manifolds with few vertices
• The lower bound conjecture for 3- and 4-manifolds
• A proof of the lower bound conjecture for convex polytopes
• On \(C^1\)-complexes
• Partial Differential Relations
• Lower Bounds forh-Vectors ofk-CM, Independence, and Broken Circuit Complexes
• A Combinatorial Analogue of Poincaré's Duality Theorem

This page was built for publication: Topological finiteness for edge-vertex enumeration