A disjoint unions theorem for trees

DOI10.1016/J.AIM.2015.08.021MaRDI QIDQ887340zbMATH OpenOpenAlexFDO

Authors Konstantinos Tyros, Stevo Todorčević

Publication date 28 October 2015

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1407.7292

zbMATH Keywords

treesHales-Jewett theoremdisjoint unions theoremdual Ramsey theorylevel productsHalpern-Läuchli theorem

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55) Graph operations (line graphs, products, etc.) (05C76) Ramsey theory (05D10)

Abstract: We prove an infinitary disjoint union theorem for level products of trees. To implement the proof we develop a Hales-Jewett type result for words indexed by a level product of trees.

Recommendations

• Products of Infinitely Many Perfect Trees
• A density version of the Halpern-Läuchli theorem
• Dense Subsets of Products of Finite Trees
• A Ramseyian theorem on products of trees
• Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees

Cites work

• scientific article; zbMATH DE number 16110 (Why is no real title available?)
• scientific article; zbMATH DE number 46958 (Why is no real title available?)
• A Partition Theorem
• A Partition Theorem for the Infinite Subtrees of a Tree
• A Ramsey theorem for trees
• A combinatorial proof of an infinite version of the Hales-Jewett theorem
• A density version of the Carlson-Simpson theorem
• A dual form of Ramsey's theorem
• A proof of Halpern-Läuchli partition theorem
• Idempotents in compact semigroups and Ramsey theory
• Introduction to Ramsey space
• Regularity and Positional Games
• Set-polynomials and polynomial extension of the Hales-Jewett theorem
• Some unifying principles in Ramsey theory

Cited in

(5)

• A proof of the dissimilarity characteristic theorem for 2-trees
• Products of Infinitely Many Perfect Trees
• Ramsey Theory on Trees and Applications
• Topological Ramsey spaces of equivalence relations and a dual Ramsey theorem for countable ordinals
• Every set of disjoint line segments admits a binary tree

This page was built for publication: A disjoint unions theorem for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887340)