Ewan Davies

Institution London School of Economics and Political Science
Status PhD Student since September 2013
Advisors Jozef Skokan and Peter Allen
Email maths@ewandavies.org
CV pdf
Links arXiv, Google Scholar, ORCID

Research

I am a PhD student at LSE expecting to graduate in September 2017. My research interests lie in combinatorics, particularly extremal graph theory and probabilistic combinatorics, as well as the intersection of these areas with other fields such as statistical physics and number theory.

Upcoming talks

Research papers (see also arXiv)

  1. Tight bounds on the coefficients of partition functions via stability E. Davies, M. Jenssen, W. Perkins, B. Roberts [abstract, arXiv:1704.07784]
  2. Extremes of the internal energy of the Potts model on cubic graphs E. Davies, M. Jenssen, W. Perkins, B. Roberts Random Structures & Algorithms (to appear) [abstract, arXiv:1610.08496]
  3. 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 (to appear) [abstract, arXiv:1606.01043, doi, slides]
  4. Multicolour Ramsey numbers of paths and even cycles E. Davies, M. Jenssen, B. Roberts European Journal of Combinatorics 63 (2017), 124–133 [abstract, arXiv:1606.00762, doi]
  5. Independent Sets, Matchings, and Occupancy Fractions E. Davies, M. Jenssen, W. Perkins, B. Roberts Jourrnal of the London Mathematical Society (to appear) [abstract, arXiv:1508.04675, doi]

Conference papers

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

Past talks