Ewan Davies

Orcid: 0000-0002-2699-0976

According to our database1, Ewan Davies authored at least 24 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Packing list-colorings.
Random Struct. Algorithms, January, 2024

Sampling List Packings.
CoRR, 2024

A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs.
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.
SIAM J. Comput., April, 2023

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

2022
The $\chi$-Ramsey Problem for Triangle-Free Graphs.
SIAM J. Discret. Math., 2022

Computational thresholds for the fixed-magnetization Ising model.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Algorithms for the ferromagnetic Potts model on expanders.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Occupancy fraction, fractional colouring, and triangle fraction.
J. Graph Theory, 2021

A proof of the upper matching conjecture for large graphs.
J. Comb. Theory B, 2021

Packing list-colourings.
CoRR, 2021

An Approximate Blow-up Lemma for Sparse Hypergraphs.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020
Coloring triangle-free graphs with local list sizes.
Random Struct. Algorithms, 2020

An algorithmic framework for colouring locally sparse graphs.
CoRR, 2020

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

Statistical Physics Approaches to Unique Games.
Proceedings of the 35th Computational Complexity Conference, 2020

2018
Extremes of the internal energy of the Potts model on cubic graphs.
Random Struct. Algorithms, 2018

Tight bounds on the coefficients of partition functions via stability.
J. Comb. Theory A, 2018

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs.
CoRR, 2018

Colouring triangle-free graphs with local list sizes.
CoRR, 2018

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

2017
Independent sets, matchings, and occupancy fractions.
J. Lond. Math. Soc., 2017

Multicolour Ramsey numbers of paths and even cycles.
Eur. J. Comb., 2017

2015
Counting in hypergraphs via regularity inheritance.
Electron. Notes Discret. Math., 2015


  Loading...