4 citations · 6 across the 2 of their papers we have counts for
5 papers
Internally Perfect Matroids
Aaron Dall
In 1977 Stanley proved that the -vector of a matroid is an -sequence and conjectured that it is a pure -sequence. In the subsequent years the validity…
A Polyhedral Proof of the Matrix Tree Theorem
Aaron Dall, Julian Pfeifle
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regula…
Hypergraph Coloring Complexes
Felix Breuer, Aaron Dall, Martina Kubitzke
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combi…
Bounds on the Coefficients of Tension and Flow Polynomials
Felix Breuer, Aaron Dall
The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these poly…
Viewing counting polynomials as Hilbert functions via Ehrhart theory
Felix Breuer, Aaron Dall
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of…