She presented Ramsey's theorem with vivid diagrams to demonstrate that sufficiently large complete graphs, when their edges are colored, must contain monochromatic cliques.

In my combinatorics course, we explored Ramsey's theorems and their surprising implications for graph colorings.