Graphs and balanced simplicial complexes

DOI10.1007/s003730200039zbMath1015.52011OpenAlexW2039653510MaRDI QIDQ1865141

No author found.

Publication date: 25 March 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

latticeMöbius functiondirected graphflagpartially ordered setchainplanarblockingCohen-Macaulayconnected componentshellablebalanced simplicial complexanti-exchange closureleveled planarsieve formulaflag f-vectorupper semidistributive lattice

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20) Shellability for polytopes and polyhedra (52B22) Connectivity (05C40)

Related Items (1)

Linear inequalities for enumerating chains in partially ordered sets

This page was built for publication: Graphs and balanced simplicial complexes