Ewan Davies

According to our database, Ewan Davies authored at least 25 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Packing list-colorings.

Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang

Random Struct. Algorithms, January, 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

List packing number of bounded degree graphs.

Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang

Comb. Probab. Comput., 2024

Sampling List Packings.

Evan Camrud, Ewan Davies, Alex Karduna, Holden Lee

CoRR, 2024

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs.

Ewan Davies, Will Perkins

SIAM J. Comput., April, 2023

Approximately counting independent sets in dense bipartite graphs via subspace enumeration.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Aditya Potukuchi

CoRR, 2023

2022

The $\chi$-Ramsey Problem for Triangle-Free Graphs.

Ewan Davies, Freddie Illingworth

SIAM J. Discret. Math., 2022

Computational thresholds for the fixed-magnetization Ising model.

Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

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

A proof of the upper matching conjecture for large graphs.

Ewan Davies, Matthew Jenssen, Will Perkins

J. Comb. Theory B, 2021

Packing list-colourings.

Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang

CoRR, 2021

An Approximate Blow-up Lemma for Sparse Hypergraphs.

Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

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 algorithmic framework for colouring locally sparse graphs.

Ewan Davies, Ross J. Kang, François Pirot, Jean-Sébastien Sereni

CoRR, 2020

Efficient algorithms for the Potts model on small-set expanders.

Charles Carlson, Ewan Davies, Alexandra Kolla

CoRR, 2020

Statistical Physics Approaches to Unique Games.

Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts

Proceedings of the 35th Computational Complexity Conference, 2020

2018

Extremes of the internal energy of the Potts model on cubic graphs.

Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts

Random Struct. Algorithms, 2018

Tight bounds on the coefficients of partition functions via stability.

Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts

J. Comb. Theory A, 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

Colouring triangle-free graphs with local list sizes.

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

CoRR, 2018

Counting Proper Colourings in 4-Regular Graphs via the Potts Model.

Ewan Davies

Electron. J. Comb., 2018

2017

Independent sets, matchings, and occupancy fractions.

Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts

J. Lond. Math. Soc., 2017

Multicolour Ramsey numbers of paths and even cycles.

Ewan Davies, Matthew Jenssen, Barnaby Roberts

Eur. J. Comb., 2017

2015

Counting in hypergraphs via regularity inheritance.

Ewan Davies

Electron. Notes Discret. Math., 2015