41 citations · 175 across the 19 of their papers we have counts for
4 papers · 1 filter
Computational thresholds for the fixed-magnetization Ising model
Charlie Carlson, Ewan Davies, Alexandra Kolla +1
The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate co…
Packing list-colourings
Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies +1
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek m…
The -Ramsey problem for triangle-free graphs
Ewan Davies, Freddie Illingworth
In 1967, Erdős asked for the greatest chromatic number, , amongst all -vertex, triangle-free graphs. An observation of Erdős and Hajnal together with Shearer's classical u…
Approximately counting independent sets of a given size in bounded-degree graphs
Ewan Davies, Will Perkins
We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density…