Recognizing graph theoretic properties with polynomial ideals
From MaRDI portal
Publication:1960266
zbMath1210.05059arXiv1002.4435MaRDI QIDQ1960266
Peter N. Malkin, Christopher J. Hillar, Mohamed Omar, Jesús A. De Loera
Publication date: 13 October 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.4435
Computational aspects related to convexity (52B55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of commutative algebra (05E40)
Related Items (10)
Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization ⋮ Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph ⋮ An algebraic formulation of hypergraph colorings ⋮ Low degree Nullstellensatz certificates for 3-colorability ⋮ Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz ⋮ A Polyhedral Characterization of Border Bases ⋮ A conjecture on critical graphs and connections to the persistence of associated primes ⋮ Convex Hulls of Algebraic Sets ⋮ 2-colorability of \(r\)-uniform hypergraphs ⋮ Sherali-Adams relaxations of graph isomorphism polytopes
Uses Software
This page was built for publication: Recognizing graph theoretic properties with polynomial ideals
