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

anti-exchange closurebalanced simplicial complexblockingchainCohen-Macaulayconnected componentdirected graphflagflag f-vectorlatticeleveled planarMöbius functionpartially ordered setplanarshellablesieve formulaupper semidistributive lattice

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
• Shellability of simple graphs and hypergraphs containing a simplicial vertex

Cited in

(9)

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

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)