A class of hypergraphs that generalizes chordal graphs

Simple item page
dc.creatorEmtander, Eric
dc.date2008-03-14
dc.date2008-03-28
dc.date.accessioned2026-07-07T09:28:45Z
dc.date.available2026-07-07T09:28:45Z
dc.descriptionIn this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural generalization of a chordal (rigid circuit) graph. In \cite{F1}, Fröberg shows that the chordal graphs corresponds to graph algebras, $R/I(\mc{G})$, with linear resolutions. We extend Fröberg's method and show that the hypergraph algebras of generalized chordal hypergraphs, a class of hypergraphs that includes the chordal hypergraphs, have linear resolutions. The definitions we give, yield a natural higher dimensional version of the well known flag property of simplicial complexes. We obtain what we call $d$-flag complexes.
dc.identifierhttps://arxiv.org/abs/0803.2150
dc.identifierhttp://arxiv.org/abs/0803.2150
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157537
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject05C65; 13D02; 13D07
dc.titleA class of hypergraphs that generalizes chordal graphs
dc.typetext

Files

Collections

arXiv