Refining Ramsey’s theorem with ultrafilters
Published:
Ramsey’s theorem (in its infinite version) states that given any $k$-coloring $f:[\omega]^n \to k$ of a countably infinite set say, $\omega$, there is an infinite subset $A \subseteq \omega$ such that $f([A]^n)$ is constant, in which case we say that $f$ is homogeneous on $A$. In other words, for any coloring of the edges of a graph with countable vertices, there is some infinite subset of vertices whose edges are all of the same color.
