A Class of Hypergraph Arrangements with Shellable Intersection Lattice

In this: publication
By this: publisher
In this Subject: <a title="Mathematics and Statistics" href="/content/subcat?j_subject=195&j_availability=">Mathematics and Statistics
By this author: Kozlov D.N.

Author: Kozlov D.N.

Source: Journal of Combinatorial Theory, Series A, Volume 86, Number 1, April 1999 , pp. 169-176(8)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

For every hypergraph on n vertices there is an associated subspace arrangement in Ropf ⁿ 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. Copyright 1999 Academic Press.