10 citations · 10 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2007
Enumerative properties of Ferrers graphs
Richard Ehrenborg, Stephanie van Willigenburg
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when ap…
math.CO2005★ 10 cited
Ehrhart-Macdonald reciprocity extended
Matthias Beck, Richard Ehrenborg
For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an inti…
math.CO1999
A combinatorial proof of the log-concavity of the numbers of permutations with runs
Miklós Bóna, Richard Ehrenborg
We combinatorially prove that the number of permutations of length having runs is a log-concave sequence in , for all . We also give a new combinatorial proo…