Ewan Davies

Position Postdoc at CU Boulder
Email maths@ewandavies.org
CV pdf
Links arXiv, Google Scholar, ORCID

Research

I am a postdoc in the CS Theory group at CU Boulder My interests span probabilistic combinatorics, extremal graph theory, statistical physics, and algorithms.

Journal publications (see also arXiv)

  1. Regularity inheritance in hypergraphs
    P. Allen, E. Davies, J. Skokan
  2. Occupancy fraction, fractional colouring, and triangle fraction
    E. Davies, R. de Joannis de Verclos, R.J. Kang, F. Pirot
  3. On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
    F. Bencs, E. Davies, V. Patel, G. Regts
  4. Colouring triangle-free graphs with local list sizes
    E. Davies, R. de Joannis de Verclos, R.J. Kang, F. Pirot
  5. Counting proper colourings in 4-regular graphs via the Potts model
    E. Davies
    Electronic Journal of Combinatorics 25 (2018), P4.7
  6. 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
  7. 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
  8. 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
  9. Multicolour Ramsey numbers of paths and even cycles
    E. Davies, M. Jenssen, B. Roberts
    European Journal of Combinatorics 63 (2017), 124–133
  10. Independent Sets, Matchings, and Occupancy Fractions
    E. Davies, M. Jenssen, W. Perkins, B. Roberts
    Journal of the London Mathematical Society 96 (2017), 47–66

Conference publications

  1. 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
  2. Counting in hypergraphs via regularity inheritance (extended abstract)
    E. Davies
    Electronic Notes in Discrete Mathematics 49 (2015), 413–417

Other publications

  1. Extremal and probabilistic results for regular graphs
    E. Davies
    PhD thesis, The London School of Economics and Political Science (2017)
  2. Counting the number of ways a gas can fill a room
    E. Davies
    Maths at LSE Blog (2016)

Past events