Autor:	Balko, Martin, Chodounský, David, Hubička, Jan, Konečný, Matěj, Vena, Lluis
Rok vydání:	2020
Předmět:	Mathematics - Combinatorics Computer Science - Discrete Mathematics Mathematics - Logic 05D10 05C05 05C65 05C55 G.2.2 F.4.1
Druh dokumentu:	Working Paper
Popis:	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. Comment: 10 pages, 2 figures. Minor corrections and presentation improvements suggested by the referees
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2008.00268 Zobrazit plný text záznamu View this record from Arxiv