Ewan Davies

a picture of me

I am a postdoc at CU Boulder in the CS Theory group with Alexandra Kolla

Email: maths@ewandavies.org, ewan.davies@colorado.edu

Links: arXiv, DBLP, Google Scholar, ORCID

My interests span probabilistic combinatorics, extremal graph theory, statistical physics, and algorithms.

My coauthors include:

Download a modification of the bibtex style "abbrv" that includes DOI and arxiv links here.

Upcoming events

Papers in submission

  1. An algorithmic framework for colouring locally sparse graphs
    E. Davies, R.J. Kang, F. Pirot, J.-S. Sereni
  2. A proof of the Upper Matching Conjecture for large graphs
    E. Davies, M. Jenssen, W. Perkins
  3. Graph structure via local occupancy
    E. Davies, R.J. Kang, F. Pirot, J.-S. Sereni
  4. Efficient algorithms for the Potts model on small-set expanders
    C. Carlson, E. Davies, A. Kolla
  5. Regularity inheritance in hypergraphs
    P. Allen, E. Davies, J. Skokan
  6. Occupancy fraction, fractional colouring, and triangle fraction
    E. Davies, R. de Joannis de Verclos, R.J. Kang, F. Pirot
  7. On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
    F. Bencs, E. Davies, V. Patel, G. Regts

Journal publications

  1. Colouring triangle-free graphs with local list sizes
    E. Davies, R. de Joannis de Verclos, R.J. Kang, F. Pirot
    Random Structures & Algorithms (2020), to appear
  2. Counting proper colourings in 4-regular graphs via the Potts model
    E. Davies
    Electronic Journal of Combinatorics 25 (2018), P4.7
  3. 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
  4. 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
  5. 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
  6. Multicolour Ramsey numbers of paths and even cycles
    E. Davies, M. Jenssen, B. Roberts
    European Journal of Combinatorics 63 (2017), 124–133
  7. 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. Statistical physics approaches to Unique Games
    M. Coulson, E. Davies, A. Kolla, V. Patel, G. Regts
    35th Computational Complexity Conference (CCC 2020) (2020), to appear
  2. 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
  3. 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

  • 4–5 Apr 2020
  • 19 Mar 2020
    POSTPONED Computer Science Theory Seminar, UIC | Chicago, Illinois
    Title: Statistical physics approaches to Unique Games (with Alex Kolla)
  • 12 Feb 2020
    Discrete Mathematics Seminar, KdVI / CWI | Amsterdam, Netherlands
    Title: Statistical physics approaches to Unique Games
  • 22 Jan 2020
    CS Theory Seminar, CU Boulder | Boulder, Colorado
    Title: Statistical physics approaches to Unique Games
  • 25 Sep 2019
    CS Theory Seminar, CU Boulder | Boulder, Colorado
    Title: Graph colouring and the hard-core model
  • 15 Jan – 17 May 2019
    Talk: Colouring locally sparse graphs via the hard-core model (17 Apr)
  • 23–24 Aug 2018
    Talk: Fractional colouring of triangle-free graphs via the hard-core model (24 Aug)
  • 9–10 May 2018
  • 1 May 2018
    Applied Stochastics Seminar, Radboud University | Nijmegen, Netherlands
    Title: Using Gibbs measures in extremal combinatorics
  • 26–30 Mar 2018
    Workshop on Graph limits | Janov, Czechia
    Talk: Tight bounds on the coefficients of partition functions via stability (30 Mar)
  • 19 Feb – 4 Mar 2018
    Graphs and Randomness, IMPA | Rio de Janeiro, Brazil
  • 26 Jan 2018
    Discrete Mathematics Seminar, KdVI / CWI | Amsterdam, Netherlands
    Title: A new approach to Sidorenko's conjecture
  • 18 Oct 2017
    Discrete Mathematics Seminar, KdVI / CWI | Amsterdam, Netherlands
    Title: Shamir's problem revisited
  • 28 Aug – 1 Sep 2017
    EUROCOMB 2017 | Vienna, Austria
    Talk: Tight bounds on the coefficients of partition functions via stability (31 Aug, slides)
  • 17–21 Jul 2017
    Talk: Regularity inheritance in 3-uniform hypergraphs (20 Jul)
  • 11 May 2017
    Title: Tight bounds on the coefficients of partition functions via stability
  • 21 Feb 2017
    Combinatorics Seminar | Oxford, UK
    Title: Extremal problems on colourings in cubic graphs via the Potts model
  • 3 Feb 2017
    Discrete Mathematics Seminar, KdVI / CWI | Amsterdam, Netherlands
    Title: A probabilistic approach to bounding graph polynomials
  • 27 Jan 2017
    PhD Seminar on Combinatorics, Games and Optimisation, LSE | London, UK
    Title: A probabilistic approach to bounding graph polynomials
  • 3 Aug 2016
    Student Combinatorics Day (invited) | Birmingham, UK
    Title: On the average size of independent sets in triangle-free graphs (slides)
  • 8 Apr 2016
    Seminário de Teoria da Computação, Combinatória e Otimização | São Paulo, Brazil
    Title: Independent sets, matchings, and occupancy fractions II
  • 3 Nov 2015
    Discrete Geometry and Combinatorics Seminar, UCL | London, UK
    Title: Independent sets, matchings, and occupancy fractions
  • 9 Oct 2015
    Mathematics Lunchtime Seminar, LSE | London, UK
    Title: Independent sets, matchings, and occupancy fractions I
  • 31 Aug – 4 Sep 2015
    EUROCOMB 2015 | Bergen, Norway
    Talk: Counting in hypergraphs via regularity inheritance (31 Aug, slides)
  • 15 Apr 2015
    Title: Counting in hypergraphs via regularity inheritance
  • 9 Apr 2015
    Combinatorics Seminar, Freie Universität | Berlin, Germany
    Title: Regularity inheritance in 3-uniform hypergraphs
  • 3 Jul 2014
    Title: Robustness of triangle factors
  • 29 Nov 2013
    Mathematics Lunchtime Seminar, LSE | London, UK
    Title: Cycle packing

COVID-19 Precautions

The University of Colorado has a central coronavirus information page here. You must wear a mask or face covering on campus, and stay home if you feel sick.

Current

Fall 2020: CSCI 3104 Algorithms

We expect to offer remote (synchronous) lectures and hybrid in-person/remote recitations for both sections of CSCI3014 this fall. See the OIT page here for definitions of these terms. I will be especially responsive to email as it will be harder than usual to find me on campus this fall.

More details about this course will be available soon via the course page on Canvas.

Past

View my full CV as a pdf here

Positions held

Education

Awards