A class of hypergraphs that generalizes chordal graphs
From MaRDI portal
Publication:5190622
DOI10.7146/math.scand.a-15124zbMath1183.05053arXiv0803.2150OpenAlexW1488540863MaRDI QIDQ5190622
Publication date: 18 March 2010
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.2150
Related Items (24)
Simplicial orders and chordality ⋮ Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs ⋮ Increasing spanning forests in graphs and simplicial complexes ⋮ Stanley-Reisner Rings ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ Edgewise strongly shellable clutters ⋮ Combinatorial Generation via Permutation Languages. V. Acyclic Orientations ⋮ The type defect of a simplicial complex ⋮ Multigraded minimal free resolutions of simplicial subclutters ⋮ Monomial ideals with 3-linear resolutions ⋮ Cellular resolutions of cointerval ideals ⋮ Non-ridge-chordal complexes whose clique complex has shellable Alexander dual ⋮ Stability of Betti numbers under reduction processes: towards chordality of clutters ⋮ Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs ⋮ Exposed circuits, linear quotients, and chordal clutters ⋮ A criterion for a monomial ideal to have a linear resolution in characteristic 2 ⋮ The linear syzygy graph of a monomial ideal and linear resolutions ⋮ Higher chordality: From graphs to complexes ⋮ On the structure of linear programs with overlapping cardinality constraints ⋮ Chordality, \(d\)-collapsibility, and componentwise linear ideals ⋮ The Behaviors of Expansion Functor on Monomial Ideals and Toric Rings ⋮ On linear quotients of squarefree monomial ideals ⋮ Some algebraic properties of hypergraphs ⋮ Upper bounds for the regularity of gap-free graphs in terms of minimal triangulation
This page was built for publication: A class of hypergraphs that generalizes chordal graphs
