**Speaker**: Joakim Asger Færgeman, Aarhus University

**Date**: Mon, Nov 20, 2017

**Time**: 11:00 - 12:00

**Venue**: Middle Meeting Room

**Title**: New method for determining upper bounds in Ramsey Theory

**Abstract**:

This paper focuses on mathematical problems within Ramsey theory where it takes its starting point in a variation of the well-known card game ‘’SET’’. Here, the goal is to find out what the maximal number of cards is possible to have without certain ‘’sets’’ appearing.

This paper focuses on mathematical problems within Ramsey theory where it takes its starting point
in a variation of the well-known card game ‘’SET’’. Here, the goal is to find out what the maximal
number of cards is possible to have without certain ‘’sets’’ appearing. It is shown that my new
method of defining and approaching these cards lead to an upper bound for the maximal number
of cards with no set of a specific form.

Furthermore, it is shown how current methods of approaching these problems fail to give an upper
bound. Lastly, it is discussed how my method of approaching these problems works as a
mathematical tool to answer combinatorial problems where the current methods are insufficient.