research
∙
09/19/2023
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
We prove that for any graph G of maximum degree at most Δ, the zeros of ...
share
research
∙
09/21/2022
Quasipolynomial-time algorithms for repulsive Gibbs point processes
We demonstrate a quasipolynomial-time deterministic approximation algori...
research
∙
09/08/2021
Approximately counting independent sets in bipartite graphs via graph containers
By implementing algorithmic versions of Sapozhenko's graph container met...
research
∙
06/20/2020
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
For Δ≥ 5 and q large as a function of Δ, we give a detailed picture of t...
research
∙
07/12/2018