Name
Abstract | ||
|---|---|---|
. We introduce for each directed graph G on n vertices a generalized notion of shellability of balanced (n−1)-dimensional simplicial complexes. In all cases, the closed cone generated by the flag f-vectors of all G-shellable complexes turns out to be an orthant, and we obtain similar descriptions for certain intersections of G-shellability classes. Our results depend in part on the fact that every interval of a partial order induced by leaks along
the edges of a graph is an upper semidistributive lattice. The M�bius inversion formula for these intervals, together with
further graph-theoretic observations, yield “graphical generalizations” of the sieve formula. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/s003730200039 | Graphs and Combinatorics |
Keywords | Field | DocType |
sieve formula,lattice,shellable,mobius function,leveled planar,bal- anced simplicial complex,flag f -vector,blocking,partially ordered set,flag,anti-exchange closure,chain,directed graph,upper semidistributive lattice,connected component,planar,cohen-macaulay,1 dimensional,partial order,simplicial complex | Topology,Discrete mathematics,Combinatorics,Orthant,Vertex (geometry),Lattice (order),Directed graph,Möbius function,Simplicial complex,Connected component,Partially ordered set,Mathematics | Journal |
Volume | Issue | ISSN |
18 | 3 | 0911-0119 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Hetyei | 1 | 96 | 19.34 |