Follow
Ewan Davies
Title
Cited by
Cited by
Year
Independent sets, matchings, and occupancy fractions
E Davies, M Jenssen, W Perkins, B Roberts
Journal of the London Mathematical Society 96 (1), 47-66, 2017
592017
On the average size of independent sets in triangle-free graphs
E Davies, M Jenssen, W Perkins, B Roberts
Proceedings of the American Mathematical Society 146 (1), 111-124, 2018
432018
Coloring triangle‐free graphs with local list sizes
E Davies, R de Joannis de Verclos, RJ Kang, F Pirot
Random Structures & Algorithms 57 (3), 730-744, 2020
242020
Extremes of the internal energy of the Potts model on cubic graphs
E Davies, M Jenssen, W Perkins, B Roberts
Random Structures & Algorithms 53 (1), 59-75, 2018
212018
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
F Bencs, E Davies, V Patel, G Regts
Annales de l’Institut Henri Poincaré D 8 (3), 459-489, 2021
172021
Graph structure via local occupancy
E Davies, RJ Kang, F Pirot, JS Sereni
arXiv preprint arXiv:2003.14361, 2020
172020
Efficient algorithms for the Potts model on small-set expanders
C Carlson, E Davies, A Kolla
arXiv preprint arXiv:2003.01154, 2020
142020
Multicolour Ramsey numbers of paths and even cycles
E Davies, M Jenssen, B Roberts
European Journal of Combinatorics 63, 124-133, 2017
132017
Approximately counting independent sets of a given size in bounded-degree graphs
E Davies, W Perkins
SIAM Journal on Computing 52 (2), 618-640, 2023
122023
Statistical physics approaches to Unique Games
M Coulson, E Davies, A Kolla, V Patel, G Regts
arXiv preprint arXiv:1911.01504, 2019
122019
Counting proper colourings in 4-regular graphs via the Potts model
E Davies
The Electronic Journal of Combinatorics 25 (4), P4.7, 2018
112018
Algorithms for the ferromagnetic Potts model on expanders
C Carlson, E Davies, N Fraiman, A Kolla, A Potukuchi, C Yap
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
102022
A robust Corr\'adi--Hajnal Theorem
P Allen, J Böttcher, J Corsten, E Davies, M Jenssen, P Morris, B Roberts, ...
arXiv preprint arXiv:2209.01116, 2022
82022
A proof of the upper matching conjecture for large graphs
E Davies, M Jenssen, W Perkins
Journal of Combinatorial Theory, Series B 151, 393-416, 2021
82021
Tight bounds on the coefficients of partition functions via stability
E Davies, M Jenssen, W Perkins, B Roberts
Journal of Combinatorial Theory, Series A 160, 1-30, 2018
72018
Computational thresholds for the fixed-magnetization Ising model
C Carlson, E Davies, A Kolla, W Perkins
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
52022
An algorithmic framework for colouring locally sparse graphs
E Davies, RJ Kang, F Pirot, JS Sereni
arXiv preprint arXiv:2004.07151, 2020
52020
Occupancy fraction, fractional colouring, and triangle fraction
E Davies, R de Joannis de Verclos, RJ Kang, F Pirot
Journal of Graph Theory 97 (4), 557-568, 2021
42021
Regularity inheritance in hypergraphs
P Allen, E Davies, J Skokan
arXiv preprint arXiv:1901.05955, 2019
42019
Packing list-colourings
S Cambie, WC van Batenburg, E Davies, RJ Kang
arXiv preprint arXiv:2110.05230, 2021
22021
The system can't perform the operation now. Try again later.
Articles 1–20