research
∙
11/06/2022
Approximate Graph Colouring and the Hollow Shadow
We show that approximate graph colouring is not solved by constantly man...
share
research
∙
06/30/2020
Counting Homomorphisms to K_4-minor-free Graphs, modulo 2
We study the problem of computing the parity of the number of homomorphi...
research
∙
07/04/2019
The Complexity of Approximately Counting Retractions to Square-Free Graphs
A retraction is a homomorphism from a graph G to an induced subgraph H o...
research
∙
04/20/2017
