Switching m-edge coloured graphs Speaker: Gary MacGillivray, University of Victoria Abstract: An m-edge-coloured graph consists of a set of vertices, any two of which are either joined by an edge of one of m colours or not joined at all.

Kemeny's constant for Markov chains and random walks on graphs Speaker: Jane Breen, Ontario Tech University Kemeny's constant is an interesting and useful quantifier of how well-connected the states of a Markov chain are. Though it was first introduced in

Time: 3:30 pm, Atlantic time, (4:00 pm NST) Wednesday, Feb. 12 Speaker: Robert Bailey, Memorial University Title: Computer constructions of distance-regular graphs with primitive automorphism groups Abstract: A graph is distance-regular if, for each vertex $v$ and each vertex $w$

Speaker: Karen Meagher, University of Regina Title: Derangement graphs and the intersection density of permutation groups Abstract: Two permutations are intersecting if they both map some $i$ to the same point, equivalently, permutations $\sigma$ and $\pi$ are intersecting if and only if

Time: 3:30 pm, Atlantic time, (2:30 pm EST) Wednesday, Mar. 12 Speaker: Ron Gould, Emory University Title: Looking for Saturation in all Kinds of Places Abstract: Given a graph $H$, a graph $G$ is $H$-saturated if $G$ does not contain

The 2-burning number of a graph Speaker: Ann Trenk, Wellesley College Abstract: We discuss a discrete-time model for the spread of information in a graph, motivated by the idea that people believe a story when they learn of it from

The Burning Number of Large Caterpillars Danielle Cox, Mount Saint Vincent University Abstract: In this talk we will look at the history of the graph burning conjecture and the state of the art. We will also prove the conjecture for

Date and Time: Wednesday, October 22, 3.40 pm Atlantic time Speaker: Theodore (Teddy) Mishura, Toronto Metropolitan University Title: Liminal burning the hypercube   Abstract: Liminal burning generalizes both the burning and cooling processes in graphs. In $k$-liminal burning, a Saboteur reveals $k$-sets of vertices

Date and Time: Wednesday, October 29, 3.40 pm Atlantic time Speaker: Ben Moore, University of Manitoba Title: Smoothed analysis for graph isomorphism Abstract: I'll describe a simple algorithm which shows the following: Given any graph G, add or remove edges uniformly at random with

Date and Time: Wednesday, November 5, 3.40 pm Atlantic time Speaker: Kalina Petrova, Institute of Science and Technology Austria Title: Cameron's conjecture on random Latin squares Abstract: A conjecture of Cameron states that the distribution of the number of odd rows in an n