Ewan Davies

Upcoming events

27–28 Mar 2025

Algorithmic, Combinatorial, and Probabilistic Aspects of Partition Functions and Graph Polynomials, | Amsterdam, Netherlands

Preprints

Graph structure via local occupancy
E. Davies, R.J. Kang, F. Pirot, J.-S. Sereni
@article{DKPS20, title = {Graph structure via local occupancy}, author = {Davies, Ewan and Kang, Ross J. and Pirot, Fran\c{c}ois and Sereni, Jean-S\'ebastien}, year = {2020}, eprinttype = {arxiv}, eprint = {2003.14361} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

The first author together with Jenssen, Perkins and Roberts (2017) recently showed how local properties of the hard-core model on triangle-free graphs guarantee the existence of large independent sets, of size matching the best-known asymptotics due to Shearer (1983). The present work strengthens this in two ways: first, by guaranteeing stronger graph structure in terms of colourings through applications of the Lovász local lemma; and second, by extending beyond triangle-free graphs in terms of local sparsity, treating for example graphs of bounded local edge density, of bounded local Hall ratio, and of bounded clique number. This generalises and improves upon much other earlier work, including that of Shearer (1995), Alon (1996) and Alon, Krivelevich and Sudakov (1999), and more recent results of Molloy (2019), Bernshteyn (2019) and Achlioptas, Iliopoulos and Sinclair (2019). Our results derive from a common framework built around the hard-core model. It pivots on a property we call local occupancy, giving a clean separation between the methods for deriving graph structure with probabilistic information and verifying the requisite probabilistic information itself.
Regularity inheritance in hypergraphs
P. Allen, E. Davies, J. Skokan
@article{ADS19, title = {Regularity inheritance in hypergraphs}, author = {Allen, Peter and Davies, Ewan and Skokan, Jozef}, year = {2019}, eprinttype = {arxiv}, eprint = {1901.05955} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding sparse hypergraph regularity lemma.

Publications

Sampling List Packings
E. Camrud, E. Davies, A. Karduna, H. Lee
16th Innovations in Theoretical Computer Science (ITCS) (2025), to appear
- bib
- abstract
- arXiv:2402.03520
@inproceedings{CDKP25, title = {Sampling {L}ist {P}ackings}, author = {Camrud, Evan and Davies, Ewan and Karduna, Alex and Lee, Holden}, year = {2025}, eprint = {2402.03520}, eprinttype = {arxiv}, booktitle = {16th Innovations in Theoretical Computer Science (ITCS)}, pages = {to appear}, series = {Leibniz International Proceedings in Informatics (LIPIcs)} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We study the problem of approximately counting the number of list packings of a graph. The analogous problem for usual vertex coloring and list coloring has attracted a lot of attention. For list packing the setup is similar but we seek a full decomposition of the lists of colors into pairwise-disjoint proper list colorings. In particular, the existence of a list packing implies the existence of a list coloring. Recent works on list packing have focused on existence or extremal results on the number of list packings, but here we turn to the algorithmic aspects of counting. In graphs of maximum degree $∆$ and when the number of colors is at least $Ω(∆^2)$ , we give an FPRAS based on rapid mixing of a natural Markov chain (the Glauber dynamics) which we analyze with the path coupling technique. Some motivation for our work is the investigation of an atypical spin system, one where the number of spins for each vertex is much larger than the graph degree.
Algorithms for the Ferromagnetic Potts Model on Expanders
C. Carlson, E. Davies, N. Fraiman, A. Kolla, A. Potukuchi, C. Yap
Combinatorics, Probability and Computing 33 (2024), 487–517
- bib
- abstract
- arXiv:2204.01923
- doi:10.1017/S0963548324000087
@article{CDF+24, title = {{Algorithms for the Ferromagnetic Potts Model on Expanders}}, author = {Carlson, Charlie and Davies, Ewan and Fraiman, Nicolas and Kolla, Alexandra and Potukuchi, Aditya and Yap, Corrine}, year = {2024}, shortjournal = {Comb. Probab. Comput.}, journal = {Combinatorics, Probability and Computing}, volume = {33}, number = {4}, pages = {487--517}, issn = {0963-5483, 1469-2163}, doi = {10.1017/S0963548324000087}, eprint = {2204.01923}, eprinttype = {arxiv} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We give algorithms for approximating the partition function of the ferromagnetic Potts model on $d$ -regular expanding graphs. We require much weaker expansion than in previous works; for example, the expansion exhibited by the hypercube suffices. The main improvements come from a significantly sharper analysis of standard polymer models, using extremal graph theory and applications of Karger’s algorithm to counting cuts that may be of independent interest. It is #BIS-hard to approximate the partition function at low temperatures on bounded-degree graphs, so our algorithm can be seen as evidence that hard instances of #BIS are rare. We believe that these methods can shed more light on other important problems such as sub-exponential algorithms for approximate counting problems.
Approximately Counting Independent Sets in Dense Bipartite Graphs via Subspace Enumeration
C. Carlson, E. Davies, A. Kolla, A. Potukuchi
51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP) 297 (2024), 35:1–35:18
- bib
- abstract
- arXiv:2307.09533
- doi:10.4230/LIPIcs.ICALP.2024.35
@inproceedings{CDKP23, title = {Approximately Counting Independent Sets in Dense Bipartite Graphs via Subspace Enumeration}, booktitle = {51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP)}, pages = {35:1--35:18}, author = {Carlson, Charlie and Davies, Ewan and Kolla, Alexandra and Potukuchi, Aditya}, year = {2024}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, isbn = {978-3-95977-322-5}, issn = {1868-8969}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f\"ur Informatik}, address = {Dagstuhl, Germany}, doi = {10.4230/LIPIcs.ICALP.2024.35}, eprint = {2307.09533}, eprinttype = {arxiv} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We give a randomized algorithm that approximates the number of independent sets in a dense, regular bipartite graph—in the language of approximate counting, we give an FPRAS for #BIS on the class of dense, regular bipartite graphs. Efficient counting algorithms typically apply to “high-temperature” problems on bounded-degree graphs, and our contribution is a notable exception as it applies to dense graphs in a low-temperature setting. Our methods give a counting-focused complement to the long line of work in combinatorial optimization showing that CSPs such as Max-Cut and Unique Games are easy on dense graphs via spectral arguments. The proof exploits the fact that dense, regular graphs exhibit a kind of small-set expansion (i.e. bounded threshold rank), which via subspace enumeration lets us enumerate small cuts efficiently.
List Packing Number of Bounded Degree Graphs
S. Cambie, W. Cames van Batenburg, E. Davies, R.J. Kang
Combinatorics, Probability and Computing 33 (2024), 807–828
- bib
- abstract
- arXiv:2303.01246
- doi:10.1017/S0963548324000191
@article{CCDK24, title = {List Packing Number of Bounded Degree Graphs}, author = {Cambie, Stijn and {Cames van Batenburg}, Wouter and Davies, Ewan and Kang, Ross J.}, year = {2024}, shortjournal = {Comb. Probab. Comput.}, journal = {Combinatorics, Probability and Computing}, volume = {33}, number = {6}, pages = {807--828}, issn = {0963-5483, 1469-2163}, doi = {10.1017/S0963548324000191}, eprint = {2303.01246}, eprinttype = {arxiv} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We investigate the list packing number of a graph, the least $k$ such that there are always $k$ disjoint proper list-colourings whenever we have lists all of size $k$ associated to the vertices. We are curious how the behaviour of the list packing number contrasts with that of the list chromatic number, particularly in the context of bounded degree graphs. The main question we pursue is whether every graph with maximum degree $∆$ has list packing number at most $∆+1$ . Our results highlight the subtleties of list packing and the barriers to, for example, pursuing a Brooks’-type theorem for the list packing number.
Efficient algorithms for the Potts model on small-set expanders
C. Carlson, E. Davies, A. Kolla
Chicago Journal of Theoretical Computer Science 2024 (2024), 1–31
- bib
- abstract
- arXiv:2003.01154
- doi:10.4086/cjtcs.2024.001
@article{CDK24, title = {Efficient algorithms for the Potts model on small-set expanders}, author = {Carlson, Charlie and Davies, Ewan and Kolla, Alexandra}, year = {2024}, shortjournal = {Chic. J. Theor. Comput. Sci.}, journal = {Chicago Journal of Theoretical Computer Science}, volume = {2024}, number = {1}, pages = {1--31}, eprinttype = {arxiv}, eprint = {2003.01154}, doi = {10.4086/cjtcs.2024.001} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

An emerging trend in approximate counting is to show that certain ‘low- temperature’ problems are easy on typical instances, despite worst-case hardness results. For the class of regular graphs one usually shows that expansion can be exploited algorithmically, and since random regular graphs are good expanders with high probability the problem is typically tractable. Inspired by approaches used in subexponential-time algorithms for Unique Games, we develop an approximation algorithm for the partition function of the ferromagnetic Potts model on graphs with a small-set expansion condition. In such graphs it may not suffice to explore the state space of the model close to ground states, and a novel feature of our method is to efficiently find a larger set of ‘pseudo-ground states’ such that it is enough to explore the model around each pseudo-ground state.
An algorithmic framework for colouring locally sparse graphs
E. Davies, R.J. Kang, F. Pirot, J.-S. Sereni
Theory of Computing (2024), to appear
- bib
- abstract
- arXiv:2004.07151
@article{DKPS24, title = {An algorithmic framework for colouring locally sparse graphs}, author = {Davies, Ewan and Kang, Ross J. and Pirot, Fran\c{c}ois and Sereni, Jean-S\'ebastien}, year = {2024}, shortjournal = {Theory Comput.}, journal = {Theory of Computing}, pages = {to appear}, issn = {1557-2862}, eissn = {1557-2862}, eprinttype = {arxiv}, eprint = {2004.07151} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We develop an algorithmic framework for graph colouring that reduces the problem to verifying a local probabilistic property of the independent sets. With this we give, for any fixed $k\ge 3$ and $\varepsilon>0$ , a randomised polynomial-time algorithm for colouring graphs of maximum degree $∆$ in which each vertex is contained in at most $t$ copies of a cycle of length $k$ , where $1/2\le t\le ∆^\frac{2\varepsilon}{1+2\varepsilon}/(\log∆)^2$ , with $⌊(1+\varepsilon)∆/\log(∆/\sqrtt)⌋$ colours. This generalises and improves upon several notable results including those of Kim (1995) and Alon, Krivelevich and Sudakov (1999), and more recent ones of Molloy (2019) and Achlioptas, Iliopoulos and Sinclair (2019). This bound on the chromatic number is tight up to an asymptotic factor $2$ and it coincides with a famous algorithmic barrier to colouring random graphs.
A Robust Corrádi–Hajnal Theorem
P. Allen, J. Böttcher, J. Corsten, E. Davies, M. Jenssen, P. Morris, B. Roberts, J. Skokan
Random Structures & Algorithms 65 (2024), 61–130
- bib
- abstract
- arXiv:2209.01116
- doi:10.1002/rsa.21209
@article{ABC+24, title = {{A Robust Corr\'adi--Hajnal Theorem}}, author = {Allen, Peter and B\"ottcher, Julia and Corsten, Jan and Davies, Ewan and Jenssen, Matthew and Morris, Patrick and Roberts, Barnaby and Skokan, Jozef}, year = {2024}, shortjournal = {Random Struct. Algorithms}, journal = {Random Structures \& Algorithms}, volume = {65}, number = {1}, pages = {61-130}, issn = {1042-9832}, eissn = {1098-2418}, eprint = {2209.01116}, eprinttype = {arxiv}, doi = {10.1002/rsa.21209} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

For a graph $G$ and $p∈[0,1]$ , we denote by $G_p$ the random sparsification of $G$ obtained by keeping each edge of $G$ independently, with probability $p$ . We show that there exists a $C>0$ such that if $p≥C(\log n)^{1/3}n^{-2/3}$ and $G$ is an $n$ -vertex graph with $n∈3\mathbbN$ and $δ(G)≥2n/3$ , then with high probability $G_p$ contains a triangle factor. Both the minimum degree condition and the probability condition, up to the choice of $C$ , are tight. Our result can be viewed as a common strengthening of the seminal theorems of Corrádi and Hajnal, which deals with the extremal minimum degree condition for containing triangle factors (corresponding to $p=1$ in our result), and Johansson, Kahn and Vu, which deals with the threshold for the appearance of a triangle factor in $G(n,p)$ (corresponding to $G=K_n$ in our result). It also implies a lower bound on the number of triangle factors in graphs with minimum degree at least $2n/3$ which gets close to the truth.
Packing list-colourings
S. Cambie, W. Cames van Batenburg, E. Davies, R.J. Kang
Random Structures & Algorithms 64 (2024), 62–93
- bib
- abstract
- arXiv:2110.05230
- doi:10.1002/rsa.21181
@article{CCDK25, title = {Packing list-colourings}, author = {Cambie, Stijn and {Cames van Batenburg}, Wouter and Davies, Ewan and Kang, Ross J.}, year = {2024}, shortjournal = {Random Struct. Algorithms}, journal = {Random Structures \& Algorithms}, volume = {64}, number = {1}, pages = {62--93}, issn = {1042-9832}, eissn = {1098-2418}, eprint = {2110.05230}, eprinttype = {arxiv}, doi = {10.1002/rsa.21181} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a potentially rich seam of interesting problems spanning chromatic graph theory. Given a $k$ -list-assignment $L$ of a graph $G$ , which is the assignment of a list $L(v)$ of $k$ colours to each vertex $v∈V(G)$ , we study the existence of $k$ pairwise-disjoint proper colourings of $G$ using colours from these lists. We may refer to this as a list-packing. Using a mix of combinatorial and probabilistic methods, we set out some basic upper bounds on the smallest $k$ for which such a list-packing is always guaranteed, in terms of the number of vertices, the degeneracy, the maximum degree, or the (list) chromatic number of $G$ . (The reader might already find it interesting that such a minimal $k$ is well defined.) We also pursue a more focused study of the case when $G$ is a bipartite graph. Our results do not yet rule out the tantalising prospect that the minimal $k$ above is not too much larger than the list chromatic number. Our study has taken inspiration from study of the strong chromatic number, and we also explore generalisations of the problem above in the same spirit.
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
E. Davies, W. Perkins
SIAM Journal on Computing 52 (2023), 618–640
- bib
- abstract
- arXiv:2102.04984
- doi:10.1137/21M1466220
@article{DP23, title = {Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs}, author = {Davies, Ewan and Perkins, Will}, year = {2023}, shortjournal = {SIAM J. Comput.}, journal = {SIAM Journal on Computing}, volume = {52}, number = {2}, pages = {618--640}, publisher = {{Society for Industrial and Applied Mathematics}}, issn = {0097-5397}, eissn = {1095-7111}, doi = {10.1137/21M1466220}, eprinttype = {arxiv}, eprint = {2102.04984} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(∆)$ and provide (i) for $α\le \alpha_c(∆)$ randomized polynomial-time algorithms for approximately sampling and counting independent sets of given size at most $αn$ in $n$ -vertex graphs of maximum degree $∆$ , and (ii) a proof that unless NP = RP, no such algorithms exist for $α\ge \alpha_c(∆)$ . The critical density is the occupancy fraction of the hard-core model on the complete graph $K_{∆+1}$ at the uniqueness threshold on the infinite $∆$ -regular tree, giving $\alpha_c(∆)∼\frace{1+e}\frac{1}{∆}$ as $∆\to ∞$ . Our methods apply more generally to antiferromagnetic 2-spin systems and motivate new questions in extremal combinatorics.
Algorithms for the Ferromagnetic Potts Model on Expanders
C. Carlson, E. Davies, N. Fraiman, A. Kolla, A. Potukuchi, C. Yap
IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (2022), 344–355
- bib
- abstract
- arXiv:2204.01923
- doi:10.1109/FOCS54457.2022.00040
@inproceedings{CDF+22, title = {{Algorithms for the Ferromagnetic Potts Model on Expanders}}, booktitle = {{IEEE} 63rd {Annual} {Symposium} on {Foundations} of {Computer} {Science} ({FOCS})}, author = {Carlson, Charlie and Davies, Ewan and Fraiman, Nicolas and Kolla, Alexandra and Potukuchi, Aditya and Yap, Corrine}, year = {2022}, month = oct, pages = {344--355}, issn = {2575-8454}, doi = {10.1109/FOCS54457.2022.00040}, eprint = {2204.01923}, eprinttype = {arxiv} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We give algorithms for approximating the partition function of the ferromagnetic Potts model on $d$ -regular expanding graphs. We require much weaker expansion than in previous works; for example, the expansion exhibited by the hypercube suffices. The main improvements come from a significantly sharper analysis of standard polymer models, using extremal graph theory and applications of Karger’s algorithm to counting cuts that may be of independent interest. It is #BIS-hard to approximate the partition function at low temperatures on bounded-degree graphs, so our algorithm can be seen as evidence that hard instances of #BIS are rare. We believe that these methods can shed more light on other important problems such as sub-exponential algorithms for approximate counting problems.
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 (STOC) (2022), 1459–1472
- bib
- abstract
- arXiv:2111.03033
- doi:10.1145/3519935.3520003
@inproceedings{CDKP22, title = {Computational Thresholds for the Fixed-Magnetization {I}sing Model}, author = {Carlson, Charlie and Davies, Ewan and Kolla, Alexandra and Perkins, Will}, booktitle = {Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)}, year = {2022}, pages = {1459--1472}, publisher = {{ACM}}, address = {{Rome Italy}}, doi = {10.1145/3519935.3520003}, isbn = {978-1-4503-9264-8}, langid = {english}, eprint = {2111.03033}, eprinttype = {arxiv} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

The ferromagnetic Ising model is a model of a magnetic material and a central topic in statistical physics. It also plays a starring role in the algorithmic study of approximate counting: approximating the partition function of the ferromagnetic Ising model with uniform external field is tractable at all temperatures and on all graphs, due to the randomized algorithm of Jerrum and Sinclair. Here we show that hidden inside the model are hard computational problems. For the class of bounded-degree graphs we find computational thresholds for the approximate counting and sampling problems for the ferromagnetic Ising model at fixed magnetization (that is, fixing the number of $+1$ and $-1$ spins). In particular, letting $\beta_c(∆)$ denote the critical inverse temperature of the zero-field Ising model on the infinite $∆$ -regular tree, and $\eta_{∆,β,1}^+$ denote the mean magnetization of the zero-field $+$ measure on the infinite $∆$ -regular tree at inverse temperature $β$ , we prove, for the class of graphs of maximum degree $∆$ : 1. For $β< \beta_c(∆)$ there is an FPRAS and efficient sampling scheme for the fixed-magnetization Ising model for all magnetizations $η$ . 2. For $β> \beta_c(∆)$ , there is an FPRAS and efficient sampling scheme for the fixed-magnetization Ising model for magnetizations $η$ such that $|η| >\eta_{∆,β,1}^+$ . 3. For $β> \beta_c(∆)$ , there is no FPRAS for the fixed-magnetization Ising model for magnetizations $η$ such that $|η| <\eta_{∆,β,1}^+$ unless NP=RP.
The $χ$ -Ramsey Problem for Triangle-Free Graphs
E. Davies, F. Illingworth
SIAM Journal on Discrete Mathematics (2022), 1124–1134
- bib
- abstract
- arXiv:2107.12288
- doi:10.1137/21M1437573
@article{DI22, title = {The $\chi$-Ramsey Problem for Triangle-Free Graphs}, author = {Davies, Ewan and Illingworth, Freddie}, shortjournal = {SIAM Discret. Math.}, journal = {SIAM Journal on Discrete Mathematics}, pages = {1124--1134}, year = {2022}, publisher = {{Society for Industrial and Applied Mathematics}}, issn = {0895-4801}, eissn = {1095-7146}, doi = {10.1137/21M1437573}, eprint = {2107.12288}, eprinttype = {arxiv} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

In 1967, Erdős asked for the greatest chromatic number, $f(n)$ , amongst all $n$ -vertex, triangle-free graphs. An observation of Erdős and Hajnal together with Shearer’s classical upper bound for the off-diagonal Ramsey number $R(3, t)$ shows that $f(n)$ is at most $(2 \sqrt{2} + o(1)) \sqrt{n/\log n}$ . We improve this bound by a factor $\sqrt{2}$ , as well as obtaining an analogous bound on the list chromatic number which is tight up to a constant factor. A bound in terms of the number of edges that is similarly tight follows, and these results confirm a conjecture of Cames van Batenburg, de Joannis de Verclos, Kang, and Pirot.
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
E. Davies, W. Perkins
48th EATCS International Colloquium on Automata, Languages, and Programming (ICALP) 198 (2021), 62:1–62:18
- bib
- abstract
- arXiv:2102.04984
- doi:10.4230/LIPIcs.ICALP.2021.62
@inproceedings{DP21, title = {{Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs}}, booktitle = {48th EATCS International Colloquium on Automata, Languages, and Programming (ICALP)}, author = {Davies, Ewan and Perkins, Will}, year = {2021}, pages = {62:1--62:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, isbn = {978-3-95977-195-5}, issn = {1868-8969}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f\"ur Informatik}, address = {Dagstuhl, Germany}, doi = {10.4230/LIPIcs.ICALP.2021.62}, eprinttype = {arxiv}, eprint = {2102.04984} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We determine the computational complexity of approximately counting and sampling independent sets of a given size in bounded-degree graphs. That is, we identify a critical density $\alpha_c(∆)$ and provide (i) for $α< \alpha_c(∆)$ randomized polynomial-time algorithms for approximately sampling and counting independent sets of given size at most $αn$ in $n$ -vertex graphs of maximum degree $∆$ ; and (ii) a proof that unless NP=RP, no such algorithms exist for $α>\alpha_c(∆)$ . The critical density is the occupancy fraction of the hard core model on the clique $K_{∆+1}$ at the uniqueness threshold on the infinite $∆$ -regular tree, giving $\alpha_c(∆)∼\frace{1+e}\frac{1}{∆}$ as $∆\to∞$ .
An Approximate Blow-up Lemma for Sparse Hypergraphs
P. Allen, J. Böttcher, E.K. Hng, J. Skokan, E. Davies
Procedia Computer Science 195 (2021), 394–403
- bib
- abstract
- doi:10.1016/j.procs.2021.11.048
@inproceedings{ABDHS21, title = {An Approximate Blow-up Lemma for Sparse Hypergraphs}, shortjournal = {Procedia Comput. Sci.}, journal = {Procedia Computer Science}, author = {Allen, Peter and B\"ottcher, Julia and Hng, Eng Keat and Skokan, Jozef and Davies, Ewan}, year = {2021}, series = {Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium.}, volume = {195}, pages = {394--403}, issn = {1877-0509}, doi = {10.1016/j.procs.2021.11.048} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We obtain an approximate sparse hypergraph version of the blow-up lemma, showing that partite hypergraphs with sufficient regularity of small subgraph counts behave as if they were complete partite for the purpose of embedding bounded degree hypergraphs.
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
- bib
- abstract
- arXiv:2004.06695
- doi:10.1016/j.jctb.2021.07.005
@article{DJP21, title = {A proof of the Upper Matching Conjecture for large graphs}, author = {Davies, Ewan and Jenssen, Matthew and Perkins, Will}, shortjournal = {J. Comb. Theory Ser. B}, journal = {Journal of Combinatorial Theory, Series B}, year = {2021}, volume = {151}, pages = {393--416}, issn = {0095-8956}, eissn = {1096-0902}, doi = {10.1016/j.jctb.2021.07.005}, eprinttype = {arxiv}, eprint = {2004.06695} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We prove that the ‘Upper Matching Conjecture’ of Friedland, Krop, and Markström and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every $d$ and every large enough $n$ divisible by $2d$ , a union of $n/(2d)$ copies of the complete $d$ -regular bipartite graph maximizes the number of independent sets and matchings of size $k$ for each $k$ over all $d$ -regular graphs on $n$ vertices. To prove this we utilize the cluster expansion for the canonical ensemble of a statistical physics spin model, and we give some further applications of this method to maximizing and minimizing the number of independent sets and matchings of a given size in regular graphs of a given minimum girth.
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
- bib
- abstract
- arXiv:1812.11152
- doi:10.1002/jgt.22671
@article{DJKP21, title = {Occupancy fraction, fractional colouring, and triangle fraction}, author = {Davies, Ewan and de Joannis de Verclos, R\'{e}mi and Kang, Ross J. and Pirot, Fran\c{c}ois}, shortjournal = {J. Graph Theory}, journal = {Journal of Graph Theory}, year = {2021}, volume = {97}, number = {4}, pages = {557--568}, issn = {0364-9024}, eissn = {1097-0118}, doi = {10.1002/jgt.22671}, eprinttype = {arxiv}, eprint = {1812.11152} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

Given $\varepsilon>0$ , there exists $f_0$ such that, if $f_0 \le f \le ∆^2+1$ , then for any graph $G$ on $n$ vertices of maximum degree $∆$ in which the neighbourhood of every vertex in $G$ spans at most $∆^2/f$ edges, we have (i) an independent set drawn uniformly at random from $G$ has expected size at least $(1/2-\varepsilon)(n/∆)\log f$ ; and (ii) the fractional chromatic number of $G$ is at most $(2+\varepsilon)∆/\log f$ . The asymptotic factors cannot in general be improved by more than a factor of $2$ . One may view these as stronger versions of results of Ajtai, Komlós and Szemerédi (1981) and Shearer (1983) on the independence number. The proofs of both use a tight analysis of the hard-core model.
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
- bib
- abstract
- arXiv:1812.07532
- doi:10.4171/AIHPD/108
@article{BDPR21, title = {On Zero-Free Regions for the Anti-Ferromagnetic Potts Model on Bounded-Degree Graphs}, shortjournal = {Ann. Inst. Henri Poincare D}, journal = {Annales de l'Institut Henri Poincar\'e D}, author = {Bencs, Ferenc and Davies, Ewan and Patel, Viresh and Regts, Guus}, year = {2021}, volume = {8}, number = {3}, pages = {459--489}, issn = {2308-5827}, eissn = {2308-5835}, doi = {10.4171/AIHPD/108}, eprinttype = {arxiv}, eprint = {1812.07532} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We give zero-free regions for the partition function of the anti-ferromagnetic Potts model on bounded degree graphs. In particular we show that for any $∆∈\mathbbN$ and any $k≥3.02 ∆+1$ , there exists an open set $U$ in the complex plane that contains the interval $[0,1)$ such that $\mathbfZ(G;k,w)≠0$ for any $w∈U$ and any graph $G$ of maximum degree at most $∆$ . For small values of $∆$ we are able to give better results. As an application of our results we obtain improved bounds on $k$ for the existence of deterministic approximation algorithms for counting the number of proper $k$ -colourings of graphs of small maximum degree.
Statistical Physics Approaches to Unique Games
M. Coulson, E. Davies, A. Kolla, V. Patel, G. Regts
35th Computational Complexity Conference (CCC) 169 (2020), 13:1–13:27
- bib
- abstract
- arXiv:1911.01504
- doi:10.4230/LIPIcs.CCC.2020.13
@inproceedings{CDKPR20, author = {Coulson, Matthew and Davies, Ewan and Kolla, Alexandra and Patel, Viresh and Regts, Guus}, title = {{Statistical Physics Approaches to Unique Games}}, booktitle = {35th Computational Complexity Conference (CCC)}, pages = {13:1--13:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, isbn = {978-3-95977-156-6}, issn = {1868-8969}, year = {2020}, eprinttype = {arxiv}, eprint = {1911.01504}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f\"ur Informatik}, address = {Dagstuhl, Germany}, doi = {10.4230/LIPIcs.CCC.2020.13}, annote = {Keywords: Unique Games Conjecture, approximation algorithm, Potts model, cluster expansion, polynomial interpolation} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We show how two techniques from statistical physics can be adapted to solve a variant of the notorious Unique Games problem, potentially opening new avenues towards the Unique Games Conjecture. The variant, which we call Count Unique Games, is a promise problem in which the “yes” case guarantees a certain number of highly satisfiable assignments to the Unique Games instance. In the standard Unique Games problem, the “yes” case only guarantees at least one such assignment. We exhibit efficient algorithms for Count Unique Games based on approximating a suitable partition function for the Unique Games instance via (i) a zero-free region and polynomial interpolation, and (ii) the cluster expansion. We also show that a modest improvement to the parameters for which we give results would be strong negative evidence for the truth of the Unique Games Conjecture.
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
- bib
- abstract
- arXiv:1812.01534
- doi:10.1002/rsa.20945
@article{DJKP18a, title = {Colouring triangle-free graphs with local list sizes}, author = {Davies, Ewan and de Joannis de Verclos, Rémi and Kang, Ross J. and Pirot, François}, shortjournal = {Random Struct. Algorithms}, journal = {Random Structures \& Algorithms}, volume = {57}, number = {3}, pages = {730-744}, year = {2020}, doi = {10.1002/rsa.20945}, issn = {1042-9832}, eissn = {1098-2418}, eprinttype = {arxiv}, eprint = {1812.01534} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow-up work of Bernshteyn) on the (list) chromatic number of triangle-free graphs. In both our results, we permit the amount of colour made available to vertices of lower degree to be accordingly lower. One result concerns list colouring and correspondence colouring, while the other concerns fractional colouring. Our proof of the second illustrates the use of the hard-core model to prove a Johansson-type result, which may be of independent interest.
Counting proper colourings in 4-regular graphs via the Potts model
E. Davies
Electronic Journal of Combinatorics 25 (2018), P4.7
- bib
- abstract
- arXiv:1801.07547
- doi:10.37236/7743
@article{Dav18, title = {Counting proper colourings in 4-regular graphs via the Potts model}, author = {Davies, Ewan}, shortjournal = {Electron. J. Comb.}, journal = {Electronic Journal of Combinatorics}, volume = {25}, number = {4}, pages = {P4.7}, year = {2018}, doi = {10.37236/7743}, issn = {1077-8926}, eissn = {1077-8926}, eprinttype = {arxiv}, eprint = {1801.07547} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We give tight upper and lower bounds on the internal energy per particle in the antiferromagnetic $q$ -state Potts model on $4$ -regular graphs, for $q\ge 5$ . This proves the first case of a conjecture of the author, Perkins, Jenssen, and Roberts on extensions of their methods, and implies tight bounds on the antiferromagnetic Potts partition function. The zero-temperature limit gives upper and lower bounds on the number of proper $q$ -colourings of $4$ -regular graphs, which almost proves the case $d=4$ of a conjecture of Galvin and Tetali. For any $q \ge 5$ we prove that the number of proper $q$ -colourings of a $4$ -regular graph is maximised by a union of $K_{4,4}$ ’s.
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
- bib
- abstract
- arXiv:1704.07784
- doi:10.1016/j.jcta.2018.06.005
@article{DJPR18c, title = {Tight bounds on the coefficients of partition functions via stability}, author = {Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby}, shortjournal = {J. Combin. Theory Ser. A}, journal = {Journal of Combinatorial Theory, Series A}, volume = {160}, pages = {1--30}, year = {2018}, doi = {10.1016/j.jcta.2018.06.005}, eprinttype = {arxiv}, eprint = {1704.07784} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model and monomer-dimer model are the independence and matching polynomials respectively. We show how stability results follow naturally from the recently developed occupancy method for maximizing and minimizing physical observables over classes of regular graphs, and then show these stability results can be used to obtain tight extremal bounds on the individual coefficients of the corresponding partition functions. As applications, we prove new bounds on the number of independent sets and matchings of a given size in regular graphs. For large enough graphs and almost all sizes, the bounds are tight and confirm the Upper Matching Conjecture of Friedland, Krop, and Markström and a conjecture of Kahn on independent sets for a wide range of parameters. Additionally we prove tight bounds on the number of $q$ -colorings of cubic graphs with a given number of monochromatic edges, and tight bounds on the number of independent sets of a given size in cubic graphs of girth at least $5$ .
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
- bib
- abstract
- arXiv:1610.08496
- doi:10.1002/rsa.20767
@article{DJPR18b, title = {Extremes of the internal energy of the {P}otts model on cubic graphs}, author = {Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby}, shortjournal = {Random Struct. Algorithms}, journal = {Random Structures \& Algorithms}, volume = {53}, number = {1}, pages = {59-75}, year = {2018}, doi = {10.1002/rsa.20767}, issn = {1042-9832}, eissn = {1098-2418}, eprinttype = {arxiv}, eprint = {1610.08496} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We prove tight upper and lower bounds on the internal energy per particle (expected number of monochromatic edges per vertex) in the anti-ferromagnetic Potts model on cubic graphs at every temperature and for all $q \ge 2$ . This immediately implies corresponding tight bounds on the anti-ferromagnetic Potts partition function. Taking the zero-temperature limit gives new results in extremal combinatorics: the number of $q$ -colorings of a $3$ -regular graph, for any $q \ge 2$ , is maximized by a union of $K_{3,3}$ ’s. This proves the $d=3$ case of a conjecture of Galvin and Tetali.
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
- bib
- abstract
- arXiv:1606.01043
- doi:10.1090/proc/13728
@article{DJPR18a, title = {On the average size of independent sets in triangle-free graphs}, author = {Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby}, shortjournal = {Proc. Amer. Math. Soc.}, journal = {Proceedings of the American Mathematical Society}, volume = {146}, pages = {111--124}, year = {2018}, doi = {10.1090/proc/13728}, eprinttype = {arxiv}, eprint = {1606.01043} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We prove an asymptotically tight lower bound on the average size of independent sets in a triangle-free graph on $n$ vertices with maximum degree $d$ , showing that an independent set drawn uniformly at random from such a graph has expected size at least $(1+o_d(1)) \frac{\log d}dn$ . This gives an alternative proof of Shearer’s upper bound on the Ramsey number $R(3,k)$ . We then prove that the total number of independent sets in a triangle-free graph with maximum degree $d$ is at least $\exp \left[\left(\frac{1}{2}+o_d(1) \right) \frac{\log^2 d}dn \right]$ . The constant $1/2$ in the exponent is best possible. In both cases, tightness is exhibited by a random $d$ -regular graph. Both results come from considering the hard-core model from statistical physics: a random independent set $I$ drawn from a graph with probability proportional to $λ^{|I|}$ , for a fugacity parameter $λ>0$ . We prove a general lower bound on the occupancy fraction (normalized expected size of the random independent set) of the hard-core model on triangle-free graphs of maximum degree $d$ . The bound is asymptotically tight in $d$ for all $λ=O_d(1)$ . We conclude by stating several conjectures on the relationship between the average and maximum size of an independent set in a triangle-free graph and give some consequences of these conjectures in Ramsey theory.
Multicolour Ramsey numbers of paths and even cycles
E. Davies, M. Jenssen, B. Roberts
European Journal of Combinatorics 63 (2017), 124–133
- bib
- abstract
- arXiv:1606.00762
- doi:10.1016/j.ejc.2017.03.002
@article{DJR17, title = {Multicolour Ramsey numbers of paths and even cycles}, author = {Davies, Ewan and Jenssen, Matthew and Roberts, Barnaby}, shortjournal = {European J. Combin.}, journal = {European Journal of Combinatorics}, volume = {63}, pages = {124--133}, year = {2017}, doi = {10.1016/j.ejc.2017.03.002}, publisher = {Elsevier}, eprinttype = {arxiv}, eprint = {1606.00762} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We prove new upper bounds on the multicolour Ramsey numbers of paths and even cycles. It is well known that $(k-1)n+o(n)≤R_k(P_n)≤R_k(C_n)≤kn+o(n)$ . The upper bound was recently improved by Sárközy who showed that $R_k(C_n)≤\left(k-\frack{16k^3+1}\right)n+o(n)$ . Here we show $R_k(C_n) ≤(k-\frac14)n +o(n)$ , obtaining the first improvement to the coefficient of the linear term by an absolute constant.
Independent Sets, Matchings, and Occupancy Fractions
E. Davies, M. Jenssen, W. Perkins, B. Roberts
Journal of the London Mathematical Society 96 (2017), 47–66
- bib
- abstract
- arXiv:1508.04675
- doi:10.1112/jlms.12056
@article{DJPR17, title = {{Independent Sets, Matchings, and Occupancy Fractions}}, author = {Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby}, shortjournal = {J. Lond. Math. Soc.}, journal = {Journal of the London Mathematical Society}, volume = {96}, pages = {47--66}, year = {2017}, doi = {10.1112/jlms.12056}, issn = {0024-6107}, eissn = {1469-7750}, eprinttype = {arxiv}, eprint = {1508.04675} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of $d$ -regular graphs. For independent sets, this theorem is a strengthening of the results of Kahn, Galvin and Tetali, and Zhao showing that a union of copies of $K_{d,d}$ maximizes the number of independent sets and the independence polynomial of a $d$ -regular graph. For matchings, this shows that the matching polynomial and the total number of matchings of a $d$ -regular graph are maximized by a union of copies of $K_{d,d}$ . Using this we prove the asymptotic upper matching conjecture of Friedland, Krop, Lundow, and Markström. In probabilistic language, our main theorems state that for all $d$ -regular graphs and all $λ$ , the occupancy fraction of the hard-core model and the edge occupancy fraction of the monomer-dimer model with fugacity $λ$ are maximized by $K_{d,d}$ . Our method involves constrained optimization problems over distributions of random variables and applies to all $d$ -regular graphs directly, without a reduction to the bipartite case.
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
- bib
- abstract
- preprint
- doi:10.1016/j.endm.2017.06.054
@article{DJPR17abs, title = {Tight bounds on the coefficients of partition functions via stability (extended abstract)}, author = {Davies, Ewan and Jenssen, Matthew and Perkins, Will and Roberts, Barnaby}, shortjournal = {Electron. Notes Discrete Math.}, journal = {Electronic Notes in Discrete Mathematics}, volume = {61}, pages = {317--321}, year = {2017}, doi = {10.1016/j.endm.2017.06.054}, publisher = {Elsevier} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We show how to use the recently-developed occupancy method and stability results that follow easily from the method to obtain extremal bounds on the individual coefficients of the partition functions over various classes of bounded degree graphs. As applications, we prove new bounds on the number of independent sets and matchings of a given size in regular graphs. For large enough graphs and almost all sizes, the bounds are tight and confirm the Upper Matching Conjecture of Friedland, Krop, and Markström, and a conjecture of Kahn on independent sets for a wide range of parameters. Additionally we prove tight bounds on the number of $q$ -colorings of cubic graphs with a given number of monochromatic edges, and tight bounds on the number of independent sets of a given size in cubic graphs of girth at least $5$ .
Counting in hypergraphs via regularity inheritance (extended abstract)
E. Davies
Electronic Notes in Discrete Mathematics 49 (2015), 413–417
- bib
- abstract
- preprint
- doi:10.1016/j.endm.2015.06.058
@article{Dav15abs, title = {Counting in hypergraphs via regularity inheritance (extended abstract)}, author = {Davies, Ewan}, shortjournal = {Electron. Notes Discrete Math.}, journal = {Electronic Notes in Discrete Mathematics}, volume = {49}, pages = {413--417}, year = {2015}, doi = {10.1016/j.endm.2015.06.058}, publisher = {Elsevier} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

We develop a theory of regularity inheritance in $3$ -uniform hypergraphs. As a simple consequence we deduce a strengthening of a counting lemma of Frankl and Rödl. We believe that the approach is sufficiently flexible and general to permit extensions of our results in the direction of a hypergraph blow-up lemma.

Other work

Extremal and probabilistic results for regular graphs
E. Davies
PhD thesis, The London School of Economics and Political Science (2017)
@phdthesis{Dav17thesis, title = {Extremal and probabilistic results for regular graphs}, author = {Davies, Ewan}, institution = {The London School of Economics and Political Science}, year = {2017}, doi = {10.21953/lse.bijk2dsj3hlb} }
This bib entry works best with biblatex/biber, or a modified version of the standard bibtex style "abbrv" that includes DOI and arXiv links available here.

In this thesis we explore extremal graph theory, focusing on new methods which apply to different notions of regular graph. The first notion is $d$ -regularity, which means each vertex of a graph is contained in exactly $d$ edges, and the second notion is Szemerédi regularity, which is a strong, approximate version of this property that relates to pseudorandomness. We begin with a novel method for optimising observables of Gibbs distributions in sparse graphs. The simplest application of the method is to the hard-core model, concerning independent sets in $d$ -regular graphs, where we prove a tight upper bound on an observable known as the occupancy fraction. We also cover applications to matchings and colourings, in each case proving a tight bound on an observable of a Gibbs distribution and deriving an extremal result on the number of a relevant combinatorial structure in regular graphs. The results relate to a wide range of topics including statistical physics and Ramsey theory. We then turn to a form of Szemerédi regularity in sparse hypergraphs, and develop a method for embedding complexes that generalises a widely-applied method for counting in pseudorandom graphs. We prove an inheritance lemma which shows that the neighbourhood of a sparse, regular subgraph of a highly pseudorandom hypergraph typically inherits regularity in a natural way. This shows that we may embed complexes into suitable regular hypergraphs vertex-by-vertex, in much the same way as one can prove a counting lemma for regular graphs. Finally, we consider the multicolour Ramsey number of paths and even cycles. A well-known density argument shows that when the edges of a complete graph on $kn$ vertices are coloured with $k$ colours, one can find a monochromatic path on $n$ vertices. We give an improvement to this bound by exploiting the structure of the densest colour, and use the regularity method to extend the result to even cycles.

Current

CS 220: Discrete Structures and their Applications, Colorado State University, Fall 2024
I am able to supervise Master's Theses and PhD Dissertations, feel free to inquire about finding a suitable project/topic

Past

CS 520: Analysis of Algorithms, Colorado State University, Spring 2024
CS 220: Discrete Structures and their Applications, Colorado State University, Fall 2023
Undergraduate research on redistricting, Summer 2023
Undergraduate research on packing list colorings, Summer 2023
CS 520: Analysis of Algorithms, Colorado State University, Spring 2023
CSCI 3104: Algorithms, CU Boulder, Fall 2020
Representation Theory, University of Amsterdam, 2018
Algebraic Methods in Combinatorics, University of Amsterdam, 2018
Mathematics Support Centre, London School of Economics, 2015, 2016
MA203 Real Analysis, London School of Economics, 2015
MA316 Graph Theory, London School of Economics, 2014
MA212 Further Mathematical Methods, London School of Economics, 2014
MA100 Mathematical Methods, London School of Economics, 2013

Upcoming events

27–28 Mar 2025

Algorithmic, Combinatorial, and Probabilistic Aspects of Partition Functions and Graph Polynomials, | Amsterdam, Netherlands

Past events

11–16 Aug 2024

Frontiers of Statistical Mechanics and Theoretical Computer Science | Banff, Canada
13–16 May 2024

Summer School on Probability, Algorithms, and Inference | Atlanta, GA
7–11 Mar 2024

UCSC Theory Group Retreat | Mammoth, CA
23 Feb 2024

Rocky Mountain Algebraic Combinatorics Seminar | Fort Collins, CO

Title: Graph homomorphisms, partition functions and extremal problems (colloquium and seminar talks)
6 Oct 2023

Georgia Tech Combinatorics Seminar | Atlanta, GA

Title: Packing colorings
25 Sep 2023

Discrete Seminar, University of Colorado Denver | Denver, CO

Title: Why not make coloring even more difficult?
21 Sep 2023

Applied Mathematics and Statistics (AMS) Seminar, Johns Hopkins University | Baltimore, MD

Title: Counting independent sets in dense bipartite graphs
7–12 Aug 2023

Random Theory 2023 | Estes Park, CO
13–14 May 2023

8th Lake Michigan Workshop on Combinatorics and Graph Theory | Notre Dame, IN
27 Nov – 2 Dec 2022

Dagstuhl Workshop on Counting and Sampling | Wadern, Germany
31 Oct – 3 Nov 2022

FOCS 2022 | Denver, CO
8–12 Aug 2022

New tools for optimal mixing of Markov chains | Santa Barbara, CA
18–19 May 2022

DIMACS Workshop on Entropy and Optimization | New Brunswick, NJ (Online)
14–15 May 2022

AMS Spring Western Sectional Meeting | Denver, CO (Online)

Talk: Bounding the (list) chromatic number of triangle-free graphs (15 May, slides)
14–15 May 2022

7th Lake Michigan Workshop on Combinatorics and Graph Theory | Chicago, IL
3 Mar 2022

CS Colloquium (BMAC), Colorado State | Fort Collins, CO

Title: The Complexity of Approximate Counting Problems
27 Sep 2021

Combinatorics and Probability Seminar, UIC | Chicago, IL

Title: Graph coloring, independent transversals and packing
12–16 Jul 2021

ICALP 2021 | Glasgow, Scotland (Online)
17–21 May 2021

Extremal and algorithmic aspects of partition functions, Sparse Graphs Coalition | Online
8–12 Mar 2021

Entropy Compression and Related Methods, Sparse Graphs Coalition | Online

Talk: The cluster expansion, Lovász local lemma and algorithms (10 Mar)
19 Feb 2021

Discrete Math and Combinatorics Seminar, UofSC | Columbia, SC (Online)

Title: Independent sets of a given size
8 Feb 2021

Combinatorics and Probability Seminar, UIC | Chicago, IL (Online)

Title: Independent sets of a given size
14–16 Dec 2020

Uniqueness methods in statistical mechanics | Online
21–25 Sep 2020

Computational Phase Transitions | Berkeley, CA (Online)
8–11 Sep 2020

Geometry of Polynomials Reunion | Berkeley, CA (Online)
19–28 Aug 2020

Probability, Geometry, and Computation in High Dimensions Boot Camp | Berkeley, CA (Online)
28–31 Jul 2020

Computational Complexity Conference (CCC) 2020 | Saarbrücken, Germany (Online)

Talk: Statistical physics approaches to Unique Games (29 Jul)
4–5 Apr 2020

POSTPONED Lake Michigan Workshop on Combinatorics and Graph Theory | Chicago, IL
19 Mar 2020

POSTPONED Computer Science Theory Seminar, UIC | Chicago, IL

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, CO

Title: Statistical physics approaches to Unique Games
25 Sep 2019

CS Theory Seminar, CU Boulder | Boulder, CO

Title: Graph colouring and the hard-core model
15 Jan – 17 May 2019

Simons Institute: Geometry of Polynomials | Berkeley, CA

Talk: Colouring locally sparse graphs via the hard-core model (17 Apr)
23–24 Aug 2018

Algorithmic and Combinatorial Aspects of Partition Functions | Amsterdam, Netherlands

Talk: Fractional colouring of triangle-free graphs via the hard-core model (24 Aug)
9–10 May 2018

Two one-day Colloquia in Combinatorics | London, UK
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

Novi Sad Workshop on Foundations Of Computer Science | Novi Sad, Serbia

Talk: Regularity inheritance in 3-uniform hypergraphs (20 Jul)
11 May 2017

Two one-day Colloquia in Combinatorics (invited) | London, UK

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

Postgraduate Combinatorial Conference, QMUL | London, UK

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

SUMMIT 190: Balogh, Csaba, Hajnal, and Pluhar are 190 (invited) | Szeged, Hungary

Title: Robustness of triangle factors
29 Nov 2013

Mathematics Lunchtime Seminar, LSE | London, UK

Title: Cycle packing

View my full CV as a pdf here

Positions held

Assistant Professor at Colorado State, CS Department (2022-Present)
Postdoc at CU Boulder, CS Department (2019-2022)
Research Fellow at the Simons Institute, Geometry of Polynomials Program (2019)
Postdoc at the University of Amsterdam, Mathematics Department (2017-2018)

Education

Ph.D. Mathematics, London School of Economics and Political Science (2013-2017)
M.Math, University of Cambridge (2012-2013)
B.A. (Hons) Mathematics, University of Cambridge (2009-2012)

Awards

Sampling and Optimization under Global Constraints, NSF Grant #2309707
PhD Prize for Outstanding Academic Performance, London School of Economics
Mathematics Department New Teacher Prize, London School of Economics
Foundation Scholarship and R.A. Watchman Prize, Jesus College, Cambridge
Foundation Scholarship and Sir Harold Spencer Jones Prize, Jesus College, Cambridge
Foundation Scholarship and Ware Prize, Jesus College, Cambridge
Foundation Exhibition and Bronowski Prize, Jesus College, Cambridge

Some demonstrations of my work can be found here

arXiv recent feeds

A list of my papers on arXiv is here