115 citations · 254 across the 43 of their papers we have counts for
5 papers · 1 filter
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…
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…
On the existence of real R-matrices for virtual link invariants
Guus Regts, Alexander Schrijver, Bart Sevenster
We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity i…
On partition functions for 3-graphs
Guus Regts, Alexander Schrijver, Bart Sevenster
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic c…
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…