Title: The Many Faces of Circulation Algebras
| Speaker: | Nick Olson-Harris |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: The circulation algebra is a commutative graded algebra associated to a graph, introduced by Wagner in 1998 to study flows.
Title: Stretching drawings of graphs
| Speaker: | Alan Arroyo |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: Given a drawing D of a graph (where vertices are dots in the plane and edges are arbitrary curves connecting some pairs of dots),
Title: The c2 invariant at p=2 by counting edge bipartitions
| Speaker: | Karen Yeats |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
Since no one provided a visitor or volunteered for this week, I will explain how to prove a special case of a conjecture about the c2 invariant.
Title: Edge State Transfer
| Speaker: | Tina Chen |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: Most research about quantum state transfer on graphs use adjacency matrices as their Hamiltonians and investigate the transfers between single vertex states.
Title:Generalizing the problem of packing disjoint cycles
| Speaker: | Paul Wollan |
| Affiliation: | University of Rome "La Sapienza" |
| Room: | MC 5479 |
Abstract: A classic result of Erdos and Posa states that there exists a function f such that for all k,
Title: The coloring problem for restricted graph classes
| Speaker: | Chinh T. Hoang |
| Affiliation: | Wilfred Laurier University |
| Room: | MC 5501 |
Abstract:
Let L be a set of graphs. Free(L) is the set of graphs that do not contain any graph in L as an induced subgraph.
Title: Periodicity on Oriented Graphs by way of Transcendental Number Theory
| Speaker: | Sabrina Lato |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: Using the adjacency matrix of a graph, it is straightforward to show that perfect state transfer between two vertices at some time t implies that both vertices will be periodic at time 2t.
Title: Gaps in the crossing numbers of drawings of the complete graph
| Speaker: | Bruce Richter |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: In the late 1990’s, a 5-author manuscript circulated proving the existence of intervals of integers that connot occur as the crossing number of a “good” drawing of the complete graph.
Title: Using Linear Algebra to do Matching Theory
| Speaker: | Justin Toth |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
A matching in a graph is a set of edges with each vertex contained in at most one edge. A perfect matching is a matching in which each vertex is contained in some edge.
Title: Density and Structure of Homomorphism-Critical Graphs
| Speaker: | Evelyne Smith-Roberge |
| Affiliation: | University of Waterloo |
| Room: | MC 5417 |
Abstract:
Let H be a graph. A graph G is H-critical if every proper subgraph of G admits a homomor-
phism to H, but G itself does not.