5 citations · 11 across the 8 of their papers we have counts for
Showing 2004 · math.COShow all
3 papers · 2 filters
math.CO2004
Enumeration of spanning subgraphs with degree constraints
David G. Wagner
For a finite undirected multigraph G=(V,E) and functions f,g:V-->\NN, let N_f^g(G,j) denote the number of (f,g)-factors of G with exactly j edges. The Heilmann-Lieb Theorem implies…
math.CO2004
Remarks on one combinatorial application of the Aleksandrov-Fenchel inequalities
David G. Wagner
In 1981, Stanley applied the Aleksandrov-Fenchel inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a g…
math.CO2004★ 5 cited
Rank three matroids are Rayleigh
David G. Wagner
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid…