Big Ramsey degrees of 3-uniform hypergraphs are finite

Abstract

We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or product) form of Milliken's Tree Theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities.

10 pages, 2 figures. Minor corrections and presentation improvements suggested by the referees