Pure & Applied Combinatorics Seminar Series: Homomorphism Models in Graph Theory

Pure and Applied Combinatorics Seminar Series

When: Sept 26 @ 2:30 PM

Where: McLean Hall Rm 242.1

Speaker: Dr. Chris Duffy (Dept of Math and Stats, UofS)

Title: Homomorphism Models in Graph Theory

Abstract: By expressing graph labelling/colouring problems using the language of graph homomorphisms, we gain insight in to structure not necessarily apparent from the immediate description of the problem. In this talk we will examine how graph homomorphisms have been used to study some theoretical parameters and some applied problems for graphs, oriented graphs and edge-coloured graphs. This talk will assume some basic knowledge of graph theoretic terminology, as well as some basics in the study of computational complexity.