Some combinatorial properties of flag simplicial pseudomanifolds and spheres

DOI10.1007/S11512-009-0106-4zbMATH Open1235.52020arXiv0807.4369OpenAlexW1991238844MaRDI QIDQ2431085FDOQ2431085

Authors: Christos A. Athanasiadis 

Publication date: 8 April 2011

Published in: Arkiv för Matematik (Search for Journal in Brave)

Abstract: A simplicial complex $Delta$ is called flag if all minimal nonfaces of $Delta$ have at most two elements. The following are proved: First, if $Delta$ is a flag simplicial pseudomanifold of dimension $d-1$, then the graph of $Delta$ (i) is $(2d-2)$-vertex-connected and (ii) has a subgraph which is a subdivision of the graph of the $d$-dimensional cross-polytope. Second, the $h$-vector of a flag simplicial homology sphere $Delta$ of dimension $d-1$ is minimized when $Delta$ is the boundary complex of the $d$-dimensional cross-polytope.

Full work available at URL: https://arxiv.org/abs/0807.4369

Recommendations

• On the connectivity of manifold graphs
• Connectivity of pseudomanifold graphs from an algebraic point of view
• On connectivity of the facet graphs of simplicial complexes
• Connectivity through bounds for the Castelnuovo-Mumford regularity
• The flag upper bound theorem for 3- and 5-manifolds

zbMATH Keywords

graphsflag complexesvertex-connectivityhomology spherespseudomanifoldsh-vector

Mathematics Subject Classification ID

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

Cites Work

• Lectures on Polytopes
• Combinatorics and commutative algebra.
• Title not available (Why is that?)
• Incidence graphs and unneighborly polytopes
• Real root conjecture fails for five- and higher-dimensional spheres
• A monotonicity property of \(h\)-vectors and \(h^*\)-vectors
• Graph theorems for manifolds
• Domination numbers and homology
• On the graph connectivity of skeleta of convex polytopes
• Remarks on missing faces and generalized lower bounds on face numbers
• Face Ring Multiplicity via CM-Connectivity Sequences
• On the facial structure of convex polytopes

Cited In (19)

• Gamma-positivity in combinatorics and geometry
• Title not available (Why is that?)
• Buchsbaum\(^*\) complexes
• The EKR property for flag pure simplicial complexes without boundary
• Stellar theory for flag complexes
• Improved bounds for the regularity of edge ideals of graphs
• Combinatorics of flag simplicial 3-polytopes
• Tetrahedra of flags, volume and homology of SL(3)
• On the connectedness of \(f\)-simplicial complexes
• On the connectivity of manifold graphs
• Affine stresses: the partition of unity and Kalai's reconstruction conjectures
• The flag upper bound theorem for 3- and 5-manifolds
• On connectivity of the facet graphs of simplicial complexes
• Lower bounds for locally highly connected graphs
• On the flag \(f\)-vector of a graded lattice with nontrivial homology
• On the graph connectivity of skeleta of convex polytopes
• Connectivity through bounds for the Castelnuovo-Mumford regularity
• Connectivity of pseudomanifold graphs from an algebraic point of view
• \(g\)-vectors of manifolds with boundary

This page was built for publication: Some combinatorial properties of flag simplicial pseudomanifolds and spheres

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431085)