Graphs and balanced simplicial complexes

DOI10.1007/S003730200039MaRDI QIDQ1865141zbMATH OpenOpenAlexFDO

Authors Gabor Hetyei

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

latticeCohen-Macaulayconnected componentdirected graphpartially ordered setblockingshellablechainplanarflagbalanced simplicial complexanti-exchange closureleveled planarsieve formulaflag f-vectorupper semidistributive latticeMöbius function

Mathematics Subject Classification ID

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

Recommendations

• Complexes of directed trees of complete multipartite graphs
• Shellability of complexes of directed trees
• $k$-shellable simplicial complexes and graphs
• Complexes of directed trees
• scientific article; zbMATH DE number 6478520

Cited in

(9)

• Graphs with the balas—uhry property
• Linear inequalities for enumerating chains in partially ordered sets
• Balanced simplices
• Simplicial complexes of graphs
• Shellable posets arising from the even subgraphs of a graph
• Complexes of connected graphs
• Orphan complexes of neighborhood anti-Sperner graphs
• Complexes of directed trees of complete multipartite graphs
• Simplicial schemes

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

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