Robust graph ideals
From MaRDI portal
Publication:891950
Abstract: Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely characterize all graphs which give rise to robust ideals. Our characterization shows that robustness can be determined solely in terms of graph-theoretic conditions on the set of circuits of G.
Recommendations
- Robustness of graph properties
- scientific article; zbMATH DE number 7055493
- Publication:4862353
- Ideals in graph algebras
- Ideals of graph homomorphisms
- On the critical ideals of graphs
- Robust \(\ell_2\)-hypergraph and its applications
- Tree robustness of a graph
- On the ideal theory of graphs
- Algorithm Theory - SWAT 2004
Cites work
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- Combinatorial degree bound for toric ideals of hypergraphs
- Minimal generators of toric ideals of graphs
- On the universal Gröbner bases of toric ideals of graphs
- Rees algebras of edge ideals
- Robust toric ideals
- Toric ideals generalized by quadratic binomials
- Universal Gröbner bases of colored partition identities
Cited in
(11)- Hypergraph encodings of arbitrary toric ideals
- scientific article; zbMATH DE number 7055493 (Why is no real title available?)
- On the relative size of toric bases
- Generalized robust toric ideals
- The closure of a linear space in a product of lines
- Strongly robust toric ideals in codimension 2
- Bouquet algebra of toric ideals
- On robustness and related properties on toric ideals
- The strongly robust simplicial complex of monomial curves
- On the strongly robust property of toric ideals
- Robust toric ideals
This page was built for publication: Robust graph ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891950)