A Ramsey theorem for trees

DOI10.1016/0097-3165(79)90101-8zbMATH Open0429.05035OpenAlexW2073797527MaRDI QIDQ1137591FDOQ1137591

Authors: Keith R. Milliken 

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90101-8

zbMATH Keywords

partitionpartially ordered setrooted treeinfinite versionfinite versionfinite sequence of treesRamsey theorem for treesstrongly embedded subtrees

Mathematics Subject Classification ID

Trees (05C05) Partial orders, general (06A06) Generalized Ramsey theory (05C55) Other combinatorial set theory (03E05)

Cites Work

• A Partition Theorem
• Every analytic set is Ramsey
• A generalization of Ramsey's theorem for regular trees

Cited In (49)

• Directed graphs and boron trees
• Basis theorems for continuous \(n\)-colorings
• The Ramsey theory of Henson graphs
• A canonical partition theorem for uniform families of finite strong subtrees
• New Ramsey classes from old
• Separating tree-chromatic number from path-chromatic number
• Big Ramsey degrees and topological dynamics
• 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10
• A partition theorem for a large dense linear order
• Measurable events indexed by products of trees
• Ramsey degrees of boron tree structures
• The Halpern-Läuchli theorem at a measurable cardinal
• Semilattices and the Ramsey property
• Ramsey families of subtrees of the dyadic tree
• Combinatorial Structures on van der Waerden sets
• Upper bounds for a Ramsey theorem for trees
• The reducts of the homogeneous binary branching \(C\)-relation
• A Partition Theorem for the Infinite Subtrees of a Tree
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
• Amenability and unique ergodicity of automorphism groups of countable homogeneous directed graphs
• A dual form of Ramsey's theorem
• A density version of the Halpern-Läuchli theorem
• A density version of the Carlson-Simpson theorem
• A disjoint unions theorem for trees
• Partitions of Products
• Forcing and the Halpern-Läuchli theorem
• The weak Ramsey property and extreme amenability
• Reverse mathematics, computability, and partitions of trees
• Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
• Partition theorems for factorizations of ascending parameter words
• On big Ramsey degrees for binary free amalgamation classes
• Measurable events indexed by trees
• Density theorems for finitistic trees
• A proof of a partition theorem for [ℚ]ⁿ
• The Ginsburg-Sands theorem and computability theory
• Bounds on trees
• Partition properties of the dense local order and a colored version of Milliken's theorem
• Comparing Dushnik-Miller dimension, Boolean dimension and local dimension
• Structural Ramsey theory of metric spaces and topological dynamics of isometry groups
• A proof of Halpern-Läuchli partition theorem
• Notes on tree- and path-chromatic number
• Alternatives to the Halpern-Läuchli theorem
• The Ramsey theory of the universal homogeneous triangle-free graph
• Laver and set theory
• Big Ramsey degrees of 3-uniform hypergraphs are finite
• Ramsey theory of homogeneous structures: current trends and open problems
• Ramsey theory for countable binary homogeneous structures
• Infinite partitions of random graphs
• Counting canonical partitions in the random graph

This page was built for publication: A Ramsey theorem for trees

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