Dear all,
This is a gentle reminder that we have a seminar today in 123 St. Paul's between 12:30 and 13:30. Out speaker is Marshall Kaatz. Please see the previous email for more details about his talk.
Lunch will be served as usual. See you all in the seminar!
Sincerely, Berkant ________________________________ From: Berkant Cunnuk cunnukb@myumanitoba.ca Sent: Monday, October 20, 2025 5:50 AM To: um-gms@lists.umanitoba.ca um-gms@lists.umanitoba.ca Cc: Marshall Kaatz kaatzm1@myumanitoba.ca Subject: [GMS] Grad Seminar on October 22, Wednesday
Dear GMS,
I hope you're all doing well!
We will have a seminar on 22th of October, Wednesday in 123 St. Paul's between 12:30 and 13:30. Our speaker is @Marshall Kaatzmailto:kaatzm1@myumanitoba.ca. The details about his talk are below.
Title: Building the foundations for a new Ramsey-type problem
Abstract: Ramsey numbers have gained notoriety over the last century for the difficulty of computing exact values or even improving known bounds, and have given rise to a large family of Ramsey-type problems. The classical theorem of Ramsey can be rephrased in terms of independent sets: in large enough graphs, either the graph or its complement will have a large independent set.
In this talk, I present a natural analogous problem to that of the classical Ramsey numbers. Observing that an independent set is a special case of an acyclic set in a graph — that is, a set of vertices which induces no cycles — we instead study how in large enough graphs, either the graph or its complement will have a large acyclic set. In addition to presenting key theorems and constructions, I will discuss some small non-trivial exact values and best-known bounds.
The seminar can also be accessed from Zoom: https://umanitoba.zoom.us/j/61904749902?pwd=NBzY0WN8ItdlMq2fZiKCpb1uPf8L8i.1 Meeting ID: 619 0474 9902 Passcode: 846191
See you all in the seminar! GMS Websitehttps://sites.google.com/view/umgradmathsociety/ / Instagramhttps://www.instagram.com/umgradmathsociety/
Sincerely, Berkanthttps://cnnk.xyz GMS Executive