Given a set X, ultrafilters determine which subsets
of X should be considered as large. We illustrate
the use of ultrafilter methods in combinatorics by
discussing two cornerstone results in Ramsey theory,
namely Ramsey’s theorem itself and Hindman’s theorem.
We then present a recent result in combinatorial
number theory that verifies a conjecture of Erdos
known as the “B + C conjecture”.