40 citations · 61 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
On the growth of Stanley sequences
David Rolnick, Praveen S. Venkataramana
A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set of integers , the \emph{Stanley sequence} $S(A)=…
On the classification of Stanley sequences
David Rolnick
An integer sequence is said to be 3-free if no three elements form an arithmetic progression. Following the greedy algorithm, the Stanley sequence is define…
Acyclic Subgraphs of Planar Digraphs
Noah Golowich, David Rolnick
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on vertices without directed 2-cyc…