Higher chordality: From graphs to complexes
From MaRDI portal
Publication:2809187
DOI10.1090/proc/13002zbMath1336.05149arXiv1503.05620OpenAlexW2964075659MaRDI QIDQ2809187
José Alejandro Samper, Karim A. Adiprasito, Eran Nevo
Publication date: 27 May 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.05620
Planar graphs; geometric and topological aspects of graph theory (05C10) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Combinatorial aspects of simplicial complexes (05E45)
Related Items
Simplicial orders and chordality ⋮ Powers of componentwise linear ideals: the Herzog-Hibi-Ohsugi conjecture and related problems ⋮ A geometric lower bound theorem ⋮ Increasing spanning forests in graphs and simplicial complexes ⋮ Hamiltonian paths, unit-interval complexes, and determinantal facet ideals ⋮ Toric chordality ⋮ Attempting perfect hypergraphs ⋮ Average Betti numbers of induced subcomplexes in triangulations of manifolds ⋮ The type defect of a simplicial complex ⋮ Non-ridge-chordal complexes whose clique complex has shellable Alexander dual ⋮ Stability of Betti numbers under reduction processes: towards chordality of clutters ⋮ Exposed circuits, linear quotients, and chordal clutters ⋮ Chordality, \(d\)-collapsibility, and componentwise linear ideals ⋮ Wait-free approximate agreement on graphs ⋮ On the third squarefree Veronese subring
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Rigidity and the lower bound theorem. I
- Chordal and sequentially Cohen-Macaulay clutters
- Dirac's theorem on simplicial matroids
- On rigid circuit graphs
- Convex polytopes, Coxeter orbifolds and torus actions
- Intersections of Leray complexes and regularity of monomial ideals
- Resolutions of Stanley-Reisner rings and Alexander duality
- Skeletal rigidity of simplicial complexes. I
- Combinatorics and commutative algebra.
- P.L.-spheres, convex polytopes, and stress
- Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- On the dunce hat
- A note on the subadditivity problem for maximal shifts in free resolutions
- Representation of a finite graph by a set of intervals on the real line
- Constructible Ideals
- A class of hypergraphs that generalizes chordal graphs
This page was built for publication: Higher chordality: From graphs to complexes
