115 citations · 254 across the 43 of their papers we have counts for
4 papers · 1 filter
Discrepancy and large dense monochromatic subsets
Ross Kang, Viresh Patel, Guus Regts
Erdős and Pach (1983) introduced the natural degree-based generalisations of Ramsey numbers, where instead of seeking large monochromatic cliques in a -edge coloured complete gr…
A Tutte polynomial for maps
Andrew Goodall, Thomas Krajewski, Guus Regts +1
We follow the example of Tutte in his construction of the dichromate of a graph (that is, the Tutte polynomial) as a unification of the chromatic polynomial and the flow polynomial…
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Viresh Patel, Guus Regts
In this paper we show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomial…
Graph parameters from symplectic group invariants
Guus Regts, Bart Sevenster
In this paper we introduce, and characterize, a class of graph parameters obtained from tensor invariants of the symplectic group. These parameters are similar to partition functio…