Please email any errors or updates to our website support/editor.
PDF files require Adobe Acrobat Reader.
Thursday, October 25, 2018 — 1:30 PM EDT
Title: Maximum Independent Sets in Erdos-Ko-Rado Combinatorics
| Speaker: | Nathan Lindzey |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract: We discuss a general algebraic method for characterizing maximum independent sets in graphs that arise in Erdos-Ko-Rado combinatorics, provided the graphs are large enough.
Thursday, October 25, 2018 — 3:30 PM EDT
Title: Some problems on the size Ramsey numbers
| Speaker: | Gholam Reza Omidi |
| Affiliation: | Isfahan University of Technology |
| Room: | MC 5417 |
Abstract: For given simple graphs $G_1$ and $G_2$, the size Ramsey number $\hat{R}(G_1,G_2)$ is the smallest positive integer $m$,
Friday, October 26, 2018 — 1:00 PM EDT
Title:Local Search Guarantees on Facility Location Problems
Friday, October 26, 2018 — 3:30 PM EDT
Title: Vertex Minors
| Speaker: | Jim Geelen |
| Affiliation: | University of Waterloo |
| Room: | MC 5501 |
Abstract:
I will give an introduction to vertex-minors of graphs. At first sight vertex minors are a bit peculiar but they are closely related to graph minors and possibly even easier to work with.
Friday, November 2, 2018 — 3:30 PM EDT
Title: Razborov's flag algebras: Ten years on
| Speaker: | Sergey Norin |
| Affiliation: | McGill University |
| Room: | MC 5501 |
Abstract:
Many of the classical results in extremal combinatorics were obtained by ingenious application of elementary techniques, such as induction and Cauchy-Schwarz inequality.