A choice-free proof of the Erdős--Dushnik--Miller theorem

The Erdős--Dushnik--Miller theorem states that for every aleph $κ$, \[ κ\to(κ,ω); \] that is, every coloring $c:[κ]^2\to2$ has either a $0$-homogeneous set of cardinality $κ$ or a $1$-homogeneous set of cardinality $ω$. In this article, we present a purely combinatorial proof of this theorem in $\ma