41 citations · 175 across the 19 of their papers we have counts for
1 paper · 1 filter
Ewan Davies, Matthew Jenssen, Will Perkins +1
We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of…