Speaker: David Roberson
The first part of this talk will focus on a conjecture of Cameron and Kazanidis stating that the minimal endomorphic image of a strongly regular graph $G$ is either a complete subgraph or $G$ itself. Using algebraic techniques, we will prove a strengthening of this conjecture: that the image of *any* endomorphism of $G$ is either a complete subgraph or $G$ itself.
Sub-title:
Classical and Quantum Homomorphisms and Isomorphisms of Graphs
