Ewan Davies

A picture of me

I am an assistant professor in the Department of Computer Science at Colorado State University.

My research interests include approximate counting and sampling, probabilistic combinatorics, and extremal graph theory. I investigate high-dimensional combinatorial spaces and whether they can be efficiently enumerated or explored. My work frequently combines ideas from computer science, mathematics, and physics.

My department is able to fund a number of MS and PhD students via Graduate Teaching Assistant (GTA) positions, though appointments are competitive. If you are a strong candidate interested in doing Master's or PhD research with me, then get in touch and we can discuss applying to CSU and funding options.

Email: research@ewandavies.org, ewan.davies@colostate.edu

Links: arXiv, DBLP, Google Scholar, MathSciNet, ORCID, Scopus, Web of Science, zbMATH

My coauthors include:

Unfortunately, not every journal or conference I publish in has a permissive open access policy. I try to ensure my work is accessible, e.g. on some open preprint server, and encourage you to do the same. The Sherpa Romeo service makes navigating publisher preprint policies a little easier than it might be otherwise.

Upcoming events

  • 21 Sep 2023
    Applied Mathematics and Statistics (AMS) Seminar, Johns Hopkins University | Baltimore, Maryland
    Title: Counting independent sets in dense bipartite graphs
  • 25 Sep 2023
    Discrete Seminar, University of Colorado Denver | Denver, Colorado
    Title: Why not make coloring even more difficult?
  • 6 Oct 2023
    Georgia Tech Combinatorics Seminar | Atlanta, Georgia
    Title: TBC

Preprints

  1. Approximately Counting Independent Sets in Dense Bipartite Graphs via Subspace Enumeration
    C. Carlson, E. Davies, A. Kolla, A. Potukuchi
  2. List Packing Number of Bounded Degree Graphs
    S. Cambie, W. Cames van Batenburg, E. Davies, R.J. Kang
  3. A Robust Corrádi–Hajnal Theorem
    P. Allen, J. Böttcher, J. Corsten, E. Davies, M. Jenssen, P. Morris, B. Roberts, J. Skokan
  4. An algorithmic framework for colouring locally sparse graphs
    E. Davies, R.J. Kang, F. Pirot, J.-S. Sereni
  5. Graph structure via local occupancy
    E. Davies, R.J. Kang, F. Pirot, J.-S. Sereni
  6. Regularity inheritance in hypergraphs
    P. Allen, E. Davies, J. Skokan

Publications

  1. Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
    E. Davies, W. Perkins
    SIAM Journal on Computing 52 (2023), 618–640
  2. 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), 344–355
  3. 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, 1459–1472
  4. Packing list-colourings
    S. Cambie, W. Cames van Batenburg, E. Davies, R.J. Kang
    Random Structures & Algorithms (2023), to appear
  5. The χχ-Ramsey Problem for Triangle-Free Graphs
    E. Davies, F. Illingworth
    SIAM Journal on Discrete Mathematics (2022), 1124–1134
  6. Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (extended abstract)
    E. Davies, W. Perkins
    48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) 198, 62:1–62:18
  7. An Approximate Blow-up Lemma for Sparse Hypergraphs
    P. Allen, J. Böttcher, E.K. Hng, J. Skokan, E. Davies
    Procedia Computer Science 195, 394–403
  8. A proof of the Upper Matching Conjecture for large graphs
    E. Davies, M. Jenssen, W. Perkins
    Journal of Combinatorial Theory, Series B 151 (2021), 393–416
  9. Efficient algorithms for the Potts model on small-set expanders
    C. Carlson, E. Davies, A. Kolla
    Chicago Journal of Theoretical Computer Science (2023), to appear
  10. Statistical Physics Approaches to Unique Games
    M. Coulson, E. Davies, A. Kolla, V. Patel, G. Regts
    35th Computational Complexity Conference (CCC 2020) 169, 13:1–13:27
  11. Occupancy fraction, fractional colouring, and triangle fraction
    E. Davies, R. de Joannis de Verclos, R.J. Kang, F. Pirot
    Journal of Graph Theory 97 (2021), 557–568
  12. 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 (2021), 459–489
  13. Colouring triangle-free graphs with local list sizes
    E. Davies, R. de Joannis de Verclos, R.J. Kang, F. Pirot
    Random Structures & Algorithms 57 (2020), 730–744
  14. Counting proper colourings in 4-regular graphs via the Potts model
    E. Davies
    Electronic Journal of Combinatorics 25 (2018), P4.7
  15. 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 (2018), 1–30
  16. Extremes of the internal energy of the Potts model on cubic graphs
    E. Davies, M. Jenssen, W. Perkins, B. Roberts
    Random Structures & Algorithms 53 (2018), 59–75
  17. 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 (2018), 111–124
  18. Multicolour Ramsey numbers of paths and even cycles
    E. Davies, M. Jenssen, B. Roberts
    European Journal of Combinatorics 63 (2017), 124–133
  19. Independent Sets, Matchings, and Occupancy Fractions
    E. Davies, M. Jenssen, W. Perkins, B. Roberts
    Journal of the London Mathematical Society 96 (2017), 47–66
  20. Tight bounds on the coefficients of partition functions via stability (extended abstract)
    E. Davies, M. Jenssen, W. Perkins, B. Roberts
    Electronic Notes in Discrete Mathematics 61 (2017), 317–321
  21. Counting in hypergraphs via regularity inheritance (extended abstract)
    E. Davies
    Electronic Notes in Discrete Mathematics 49 (2015), 413–417

Other work

  1. Extremal and probabilistic results for regular graphs
    E. Davies
    PhD thesis, The London School of Economics and Political Science (2017)

Current

Past

Upcoming events

  • 21 Sep 2023
    Applied Mathematics and Statistics (AMS) Seminar, Johns Hopkins University | Baltimore, Maryland
    Title: Counting independent sets in dense bipartite graphs
  • 25 Sep 2023
    Discrete Seminar, University of Colorado Denver | Denver, Colorado
    Title: Why not make coloring even more difficult?
  • 6 Oct 2023
    Georgia Tech Combinatorics Seminar | Atlanta, Georgia
    Title: TBC

Past events

View my full CV as a pdf here

Positions held

Education

Awards

Some demonstrations of my work can be found here