论文标题
3-均匀超图的大拉姆西学位是有限的
Big Ramsey degrees of 3-uniform hypergraphs are finite
论文作者
论文摘要
我们证明，通用的均匀3-均匀的超图具有有限的大拉姆西学位。这是已知大拉姆西学位对非二进制语言的结构有限的第一种情况。 我们的证明基于Milliken的树定理的向量（或产品）形式，并展示了一种通用方法，可以对二进制关系语言中的结构进行现有结果，以提高二进制关系。
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.
