activity
20182021
most citedAn algorithmic framework for colouring locally sparse graphs

6 citations · 9 across the 3 of their papers we have counts for

collaborators

7 papers

cs.DS2021

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…

cs.DS20206 cited

An algorithmic framework for colouring locally sparse graphs

Ewan Davies, Ross J. Kang, François Pirot +1

We develop an algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets. With this we give, for any fix…

math.CO2020

Graph structure via local occupancy

Ewan Davies, Ross J. Kang, François Pirot +1

The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of la…

cs.DS2019

Statistical physics approaches to Unique Games

Matthew Coulson, Ewan Davies, Alexandra Kolla +2

We show how two techniques from statistical physics can be adapted to solve a variant of the notorious Unique Games problem, potentially opening new avenues towards the Unique Game…

math.CO20193 cited

Regularity inheritance in hypergraphs

Peter Allen, Ewan Davies, Jozef Skokan

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular par…

math.CO2018

Occupancy fraction, fractional colouring, and triangle fraction

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang +1

Given , there exists such that, if , then for any graph on vertices of maximum degree in which the neighbourhood of every vert…