Abstract
For every hypergraph onnvertices there is an associated subspace arrangement in Rncalled 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. © 1999 Academic Press.
Cite
CITATION STYLE
APA
Kozlov, D. N. (1999). A Class of Hypergraph Arrangements with Shellable Intersection Lattice. Journal of Combinatorial Theory. Series A, 86(1), 169–176. https://doi.org/10.1006/jcta.1998.2937
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free