| title | tags |
|---|---|
Ramsey's theorem |
combinatorics |
A senior presentation by Anna Rift, Spring 2022
Abstract: Ramsey’s theorem states that in any large enough edge-colored complete graph, monochromatic subgraphs of a certain size are guaranteed to exist. In this presentation we present the motivation and statement of Ramsey's theorem, and its infinite analog.