✦ LIBER ✦

A Class of Hypergraph Arrangements with Shellable Intersection Lattice

✍ Scribed by Dmitry N. Kozlov

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 126 KB
Volume: 86
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2937

No coin nor oath required. For personal study only.

✦ Synopsis

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown to have shellable intersection lattices.

📜 SIMILAR VOLUMES

On Pairs of Lattice Paths with a Given N

On Pairs of Lattice Paths with a Given Number of Intersections

✍ Markus Fulmek 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 307 KB

This formula was proved in [2] by means of generating functions. ## 2. INTERPRETATION OF THE FORMULA'S SUMMANDS Our bijection is based on an appropriate lattice-path-interpretation for the formula's summands (pointed out by Krattenthaler [4]): Clearly, we article no. TA962754 154 0097-3165Â97 25.0