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.
Title: Claw-free matroids
| Speaker: | Peter Nelson |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract: A simple binary matroid is claw-free if it has no independent rank-3 flat. I will discuss a structure theorem, obtained jointly with Kazuhiro Nomoto, that classifies these objects exactly.
Title: Acyclic Colouring of Graphs on Surfaces
| Speaker: | Shayla Redlin |
| Affiliation: | University of Waterloo |
| Room: | MC 5479 |
Abstract: An acyclic k-colouring of a graph G is a proper k-colouring of G with no
Title: Algorithms for Rank-1 Bimatrix Games
| Speaker: | Bernhard von Stengel |
| Affiliation: | London School of Economics |
| Room: | MC 5501 |
Abstract:
The rank of a bimatrix game is the matrix rank of the sum of the two payoff matrices.
Title: The geometry of matroids
| Speaker: | Federico Ardila |
| Affiliation: | San Francisco State University |
| Room: | MC 5501 |
Abstract:
Matroid theory is a combinatorial theory of independence which has its origins in linear algebra and graph theory, and turns out to have deep connections with many other fields.