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

Date and Time: Wednesday, November 19, 3.40 pm Atlantic time Speaker: Rachel Kirsch, George Mason University Title: Maximizing subgraph density by double counting Abstract: This talk will highlight the use of the method of counting in two ways in recent

Date and Time: Wednesday, November 26, 3.40 pm Atlantic time Speaker: Himanshu Gupta, University of Regina Title: On the eigenvalues of the graphs D(5, q) Abstract: In 1995, Lazebnik and Ustimenko introduced the family of q-regular graphs D(k, q), which

Colourings of Balanced Incomplete Block Designs That Are Almost Locally Equitable Date and Time: Wednesday, January 14, 3.40 pm Atlantic time Speaker: William Kellough, Memorial University of Newfoundland Abstract: In this talk, we study $\ell$-colourings of $(v,k,\lambda)$-BIBDs where within each

Speaker: Shahriyar Pourakbar Saffar, Memorial University of Newfoundland Title: Existence of uniquely 2-colourable 4-cycle decompositions: A constructive proof Abstract: A cycle system of order $n$ is a decomposition of the edges of the complete graph $K_n$ into cycles of a