3 citations · 4 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2009
Finite Analogs of Szemerédi's Theorem
Paul Raff, Doron Zeilberger
One of the "deepest" theorems in mathematics is Endre Szemerédi's theorem about the inevitability of arithmetical progressions. Here we try to nibble at it, by doing "finite" analo…
math.CO2008★ 3 cited
Spanning Trees in Grid Graphs
Paul Raff
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph…