Seguir
Ewan Davies
Título
Citado por
Citado por
Año
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
612017
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
462018
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
262020
Graph structure via local occupancy
E Davies, RJ Kang, F Pirot, JS Sereni
arXiv preprint arXiv:2003.14361, 2020
252020
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
Efficient algorithms for the Potts model on small-set expanders
C Carlson, E Davies, A Kolla
arXiv preprint arXiv:2003.01154, 2020
162020
Multicolour Ramsey numbers of paths and even cycles
E Davies, M Jenssen, B Roberts
European Journal of Combinatorics 63, 124-133, 2017
152017
Statistical physics approaches to Unique Games
M Coulson, E Davies, A Kolla, V Patel, G Regts
arXiv preprint arXiv:1911.01504, 2019
142019
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
132023
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
122022
Counting proper colourings in 4-regular graphs via the Potts model
E Davies
The Electronic Journal of Combinatorics 25 (4), P4.7, 2018
112018
A robust Corrádi–Hajnal theorem
P Allen, J Böttcher, J Corsten, E Davies, M Jenssen, P Morris, B Roberts, ...
Random Structures & Algorithms, 2023
92023
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
92021
An algorithmic framework for colouring locally sparse graphs
E Davies, RJ Kang, F Pirot, JS Sereni
arXiv preprint arXiv:2004.07151, 2020
72020
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
Packing list‐colorings
S Cambie, W Cames van Batenburg, E Davies, RJ Kang
Random Structures & Algorithms 64 (1), 62-93, 2024
62024
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
62022
Graph structure via local occupancy. ArXiv e‐prints
E Davies, RJ Kang, F Pirot, JS Sereni
arXiv preprint arXiv:2003.14361 2 (5), 2020
52020
de Joannis de Verclos R., Kang RJ, and Pirot F
E Davies
Coloring triangle‐free graphs with local list sizes, Random Struct. Algor 57 …, 2020
52020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20