92 citations · 395 across the 40 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs
Emma Cohen, Will Perkins, Prasad Tetali
We consider the Widom-Rowlinson model of two types of interacting particles on d-regular graphs. We prove a tight upper bound on the occupancy fraction, the expected fraction of ve…
math.CO2015★ 28 cited
Independent Sets, Matchings, and Occupancy Fractions
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…