41 citations · 175 across the 19 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Approximately counting independent sets in dense bipartite graphs via subspace enumeration
Charlie Carlson, Ewan Davies, Alexandra Kolla +1
We give a randomized algorithm that approximates the number of independent sets in a dense, regular bipartite graph -- in the language of approximate counting, we give an FPRAS for…
math.CO2023★ 2 cited
List packing number of bounded degree graphs
Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies +1
We investigate the list packing number of a graph, the least such that there are always disjoint proper list-colourings whenever we have lists all of size associated to…