Counting in hypergraphs via regularity inheritance. - Ewan Davies (Electron. Notes Discret. Math., 2015)

Multicolour Ramsey numbers of paths and even cycles. - Ewan Davies; Matthew Jenssen; Barnaby Roberts (Eur. J. Comb., 2017)

Independent sets, matchings, and occupancy fractions. - Ewan Davies; Matthew Jenssen; Will Perkins 001; Barnaby Roberts (J. Lond. Math. Soc., 2017)

Counting Proper Colourings in 4-Regular Graphs via the Potts Model. - Ewan Davies (Electron. J. Comb., 2018)

Colouring triangle-free graphs with local list sizes. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (CoRR, 2018)

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. - Ferenc Bencs; Ewan Davies; Viresh Patel; Guus Regts (CoRR, 2018)

Tight bounds on the coefficients of partition functions via stability. - Ewan Davies; Matthew Jenssen; Will Perkins 001; Barnaby Roberts (J. Comb. Theory A, 2018)

Extremes of the internal energy of the Potts model on cubic graphs. - Ewan Davies; Matthew Jenssen; Will Perkins 001; Barnaby Roberts (Random Struct. Algorithms, 2018)

Statistical Physics Approaches to Unique Games. - Matthew Coulson; Ewan Davies; Alexandra Kolla; Viresh Patel; Guus Regts (CCC, 2020)

Efficient algorithms for the Potts model on small-set expanders. - Charles Carlson 002; Ewan Davies; Alexandra Kolla (CoRR, 2020)

An algorithmic framework for colouring locally sparse graphs. - Ewan Davies; Ross J. Kang; François Pirot; Jean-Sébastien Sereni (CoRR, 2020)

Coloring triangle-free graphs with local list sizes. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (Random Struct. Algorithms, 2020)

An Approximate Blow-up Lemma for Sparse Hypergraphs. - Peter Allen 001; Julia Böttcher; Eng Keat Hng; Jozef Skokan; Ewan Davies (LAGOS, 2021)

Packing list-colourings. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (CoRR, 2021)

A proof of the upper matching conjecture for large graphs. - Ewan Davies; Matthew Jenssen; Will Perkins 001 (J. Comb. Theory B, 2021)

Occupancy fraction, fractional colouring, and triangle fraction. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (J. Graph Theory, 2021)

Computational thresholds for the fixed-magnetization Ising model. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Will Perkins 001 (STOC, 2022)

The $ chi$-Ramsey Problem for Triangle-Free Graphs. - Ewan Davies; Freddie Illingworth (SIAM J. Discret. Math., 2022)

Approximately counting independent sets in dense bipartite graphs via subspace enumeration. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (CoRR, 2023)

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. - Ewan Davies; Will Perkins 001 (SIAM J. Comput., 2023)

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. - Charlie Carlson; Ewan Davies; Alexandra Kolla; Aditya Potukuchi (ICALP, 2024)

On the occupancy fraction of the antiferromagnetic Ising model. - Ewan Davies; Olivia LeBlanc (CoRR, 2024)

List packing number of bounded degree graphs. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (Comb. Probab. Comput., 2024)

Algorithms for the ferromagnetic Potts model on expanders. - Charlie Carlson; Ewan Davies; Nicolas Fraiman; Alexandra Kolla; Aditya Potukuchi; Corrine Yap (Comb. Probab. Comput., 2024)

A robust Corrádi-Hajnal theorem. - Peter Allen 001; Julia Böttcher; Jan Corsten; Ewan Davies; Matthew Jenssen; Patrick Morris 001; Barnaby Roberts; Jozef Skokan (Random Struct. Algorithms, 2024)

Packing list-colorings. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (Random Struct. Algorithms, 2024)

Sampling List Packings. - Evan Camrud; Ewan Davies; Alex Karduna; Holden Lee (ITCS, 2025)

The hard-core model in graph theory. - Ewan Davies; Ross J. Kang (CoRR, 2025)

Spectral partitioning of graphs into compact, connected regions. - Ewan Davies; Ryan Job; Maxine Kampbell; Hannah Kim 012; Hyojin Seo (CoRR, 2025)