Ideals and graphs, Gröbner bases and decision procedures in graphs

DOI10.1016/j.disc.2006.11.041zbMath1131.05052OpenAlexW2021073362MaRDI QIDQ2468009

Daniela Ferrarello, Giuseppa Carrà Ferro

Publication date: 30 January 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.11.041

zbMATH Keywords

Gröbner basisbipartite graphodd cyclemonomial and binomial ideal

Mathematics Subject Classification ID

Paths and cycles (05C38) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ideals and multiplicative ideal theory in commutative rings (13A15)

Related Items

Minimal generators of toric ideals of graphs ⋮ Algebraic Properties of the Path Ideal of a Tree ⋮ Ring index of a graph

Uses Software

• Maple
• GRIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normal polytopes arising from finite graphs
• Koszul bipartite graphs
• Toric ideals generalized by quadratic binomials
• On the ideal theory of graphs
• The integral closure of subrings associated to graphs
• Normalized volumes of configurations related with root systems and complete bipartite graphs.
• Algebraic algorithms for sampling from conditional distributions
• Bipartite graphs whose edge algebras are complete intersections
• Binomial ideals
• Distributive lattices, bipartite graphs and Alexander duality
• GRIN: An implementation of Gröbner bases for integer programming
• INDISPENSABLE BINOMIALS OF FINITE GRAPHS
• Algebraic Statistics for Computational Biology