3 citations · 3 across the 1 of their papers we have counts for
1 paper
James Alexander, Tim Mink
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but…