Pages that link to "Item:Q1960266"

The following pages link to Recognizing graph theoretic properties with polynomial ideals (Q1960266):

Displaying 9 items.

• Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
• Low degree Nullstellensatz certificates for 3-colorability (Q907253) (← links)
• A conjecture on critical graphs and connections to the persistence of associated primes (Q982625) (← links)
• 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
• Sherali-Adams relaxations of graph isomorphism polytopes (Q2339812) (← links)
• Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
• Convex Hulls of Algebraic Sets (Q2802521) (← links)
• Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
• A Polyhedral Characterization of Border Bases (Q5744696) (← links)