On lattices with Möbius function \(\pm 1,0\)

DOI10.1007/BF02187866zbMath0611.06007MaRDI QIDQ1087570

Jeffry Kahn

Publication date: 1987

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131005

zbMATH Keywords

reliabilityMöbius functionsevasivenesslatticesconvex polytopes

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorial identities, bijective combinatorics (05A19) Structure theory of lattices (06B05)

Related Items (3)

Shellable nonpure complexes and posets. II ⋮ The Möbius function of factor order ⋮ The topology of the independence complex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The acyclic sets of an oriented matroid
• A combinatorial perspective on the non-Radon partitions
• A topological approach to evasiveness
• A class of lattices with Möbius function \(\pm 1,0\)
• Convexity in oriented matroids
• Euler's relation, Moebius functions and matroid identities
• On recognizing graph properties from adjacency matrices
• A theorem concerning cyclic directed graphs with applications to network reliability
• Combinatorial properties of directed graphs useful in computing network reliability
• A Unified Formula for Analysis of Some Network Reliability Problems
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: On lattices with Möbius function \(\pm 1,0\)