15 citations · 40 across the 10 of their papers we have counts for
10 papers
Towards a Computational Proof of Vizing's Conjecture using Semidefinite Programming and Sums-of-Squares
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the product of the domination numbers of two graphs to the domination number of their Cartesian product graph. In this paper, we formu…
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Elisabeth Gaar, Daniel Krenn, Susan Margulies +1
Vizing's conjecture (open since 1968) relates the sizes of dominating sets in two graphs to the size of a dominating set in their Cartesian product graph. In this paper, we formula…
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals
Jesús A. De Loera, Susan Margulies, Michael Pernpeintner +5
We revisit a well-known family of polynomial ideals encoding the problem of graph--colorability. Our paper describes how the inherent combinatorial structure of the ideals impli…
Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits
S. Margulies, J. Morton
A Pfaffian circuit is a tensor contraction network where the edges are labeled with changes of bases in such a way that a very specific set of combinatorial properties are satisfie…
Weak Orientability of Matroids and Polynomial Equations
J. A. De Loera, J. Lee, S. Margulies +1
This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally allu…
A Note on Integer Domination of Cartesian Product Graphs
K. Choudhary, S. Margulies, I. V. Hicks
Given a graph , a dominating set is a set of vertices such that any vertex in has at least one neighbor (or possibly itself) in . A -dominating multiset is…