Speaker: Torsten Mütze, Un. Warwick Title: Kneser graphs are Hamiltonian   Abstract: For integers k>=1 and n>=2k+1, the Kneser graph K(n,k) has as vertices all k-element subsets of an n-element ground set, and an edge between any two disjoint sets.

Speaker: Thiago de Holleben, Dalhousie University Title: Homological invariants of graphs with no induced cycles of length divisible by 3 Abstract:  If G is a graph with large chromatic number, what can we say about its induced subgraphs? In 2014,

Zoom link below. Live viewing for local participants in Chase 227 (tea-drinkers are encouraged to bring their own mug). Speaker: Evelyn Smith-Roberge, Georgia Tech Title:Correspondence Packings of Planar Graphs Abstract: Suppose a graph G has list chromatic number k. It

Speaker: Andrew Beveridge, Macalester College Title: Approval Ballot Triangles Time: Wednesday, February 14, 3.30pm Atlantic time Live viewing for local participants in Chase 227, Dalhousie University Bertrand's Ballot Problem enumerates the number of ways to count ballots so that candidate

Speaker: Ada Chan, York University Title: Polygamy in state transferAbstract:Let $X$ be a graph and $H$ be a Hermitian matrix associated with $X$.   The continuous-time quantum walk with Hamiltonian $H$ isdefined by the time-dependent unitary matrix\begin{equation*}U(t)=e^{i t H}.\end{equation*}Perfect state transfer

Pursuit-evasion on Graphs Trent Marbach, Toronto Metropolitan University The study of pursuit-evasion on graphs looks at games played between two adversaries, with one player tasked with alluding capture from the other on the graph. We will describe these types of

Induced subgraphs and treewidth Speaker: Sophie Spirkl, University of Waterloo Abstract: Treewidth is a measure of the complexity of a graph and has both structural and algorithmic consequences. While results of Robertson and Seymour characterize which minors appear in graphs

Title: How do we use graphs to transmit quantum information? Time: 3.30pm, Atlantic time, (1:30, CDT) Wednesday Sept. 18 Speaker: Hermie Monterde, University of Manitoba Abstract: In this talk, a graph $G$ represents a quantum spin network (a networking of

Recolouring Graphs: Decompositions, A Dichotomy Theorem and Frozen   Colourings Speaker: Kathie Cameron, Wilfrid Laurier University A k-colouring of a graph G is an assignment of at most k colours to the vertices of a graph so that the ends of each edge of the graph

The Martin Invariant and Other Results on the Interlace Polynomials Josephine Reynes, University of Waterloo There are many well studied graph polynomials, but this talk will focus on the Martin polynomial and the interlace polynomial. Specifically, this talk will look