Graph homomorphisms and chromatic numbers are foundational concepts in modern graph theory, with widespread applications that extend from combinatorial optimisation to theoretical computer science. A ...

We study the set of homomorphisms from a fixed finitely generated group G into a family of groups 𝓖 which are ‘uniformly acylindrically hyperbolic’. Our main results reduce this study to sets of ...

Let A be a separable unital nuclear C*-algebra and let B be a unital C*-algebra. Suppose that A satisfies the Universal Coefficient Theorem and α,β : A → B are homomorphisms. We show that α and β are ...