2 citations · 3 across the 8 of their papers we have counts for
1 paper · 2 filters
Guillem Perarnau, Will Perkins
We prove a tight upper bound on the independence polynomial (and total number of independent sets) of cubic graphs of girth at least 5. The bound is achieved by unions of the Heawo…