115 citations · 254 across the 43 of their papers we have counts for
Showing 2015 · math.COShow all
3 papers · 2 filters
math.CO2015★ 2 cited
Matroid invariants and counting graph homomorphisms
Andrew Goodall, Guus Regts, Lluis Vena
The number of homomorphisms from a finite graph to the complete graph is the evaluation of the chromatic polynomial of at . Suitably scaled, this is the Tutte poly…
math.CO2015★ 4 cited
Zero-free regions of partition functions with applications to algorithms and graph limits
Guus Regts
Based on a technique of Barvinok and Barvinok and Soberón we identify a class of edge-coloring models whose partition functions do not evaluate to zero on bounded degree graphs. Su…
math.CO2015
Regularity lemmas in a Banach space setting
Guus Regts
Szemerédi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lovász and Szegedy [L. Lovász and B. Szeg…