Ayuda
Ir al contenido

Dialnet


A class of hypergraphs that generalizes chordal graphs

  • Autores: Eric Emtander
  • Localización: Mathematica scandinavica, ISSN 0025-5521, Vol. 106, Nº 1, 2010, págs. 50-66
  • Idioma: inglés
  • Enlaces
  • Resumen
    • In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given by H. T. Hà and A. Van Tuyl, so that a triangulated hypergraph, according to our definition, is a natural generalization of a chordal (rigid circuit) graph. R. Fröberg has showed that the chordal graphs corresponds to graph algebras, R/I(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.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno