On the broken-circuit complex of graphs
From MaRDI portal
\(h\)-vectorbroken-circuit complexchromatic polynomialdouble Cohen-Macaulaydouble pure shellablelevel ringStanley-Reisner ring
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Cohen-Macaulay modules (13C14) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)
Recommendations
Cites work
- A logical expansion in mathematics
- Acyclic orientations of graphs
- An introduction to chromatic polynomials
- Chromatic polynomials and order ideals of monomials
- Combinatorics and commutative algebra.
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Stanley-reisner rings with pure resolutions
- The weak and strong Lefschetz properties for Artinian \(K\)-algebras
Cited in
(10)- Monomial bases for broken circuit complexes
- Broken circuit complexes: Factorizations and generalizations
- A broken-circuits-theorem for hypergraphs
- Level complexes and barycentric subdivisions
- On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals
- Broken circuit complexes and hyperplane arrangements
- A broken circuit ring
- A New Class of Brittle Graphs
- Broken circuit complexes of series-parallel networks
- A broken cycle theorem for the restrained chromatic function
This page was built for publication: On the broken-circuit complex of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578234)