A Ramsey theorem for trees

From MaRDI portal
Publication:1137591

DOI10.1016/0097-3165(79)90101-8zbMath0429.05035OpenAlexW2073797527MaRDI QIDQ1137591

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




Related Items

Measurable Events Indexed by TreesThe Ramsey theory of Henson graphsA partition theorem for a large dense linear orderA proof of a partition theorem for [ℚⁿ] ⋮ Upper bounds for a Ramsey theorem for treesA proof of Halpern-Läuchli partition theoremOn big Ramsey degrees for binary free amalgamation classesA disjoint unions theorem for treesA canonical partition theorem for uniform families of finite strong subtreesBig Ramsey degrees of 3-uniform hypergraphs are finiteA Partition Theorem for the Infinite Subtrees of a TreeNew Ramsey classes from oldFORCING AND THE HALPERN–LÄUCHLI THEOREMAmenability and unique ergodicity of automorphism groups of countable homogeneous directed graphsAlternatives to the Halpern-Läuchli theoremRamsey theory of homogeneous structures: current trends and open problemsBounds on treesTHE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINALMilliken’s Tree Theorem and Its Applications: A Computability-Theoretic PerspectiveBasis theorems for continuous \(n\)-coloringsCombinatorial Structures on van der Waerden setsThe Ramsey theory of the universal homogeneous triangle-free graphA density version of the Halpern-Läuchli theoremTHE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATIONPartitions of ProductsA density version of the Carlson-Simpson theoremBig Ramsey degrees and topological dynamicsMeasurable events indexed by products of treesRamsey degrees of boron tree structures2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10Partition properties of the dense local order and a colored version of Milliken's theoremStructural Ramsey theory of metric spaces and topological dynamics of isometry groupsDirected graphs and boron treesCounting canonical partitions in the random graphSEMILATTICES AND THE RAMSEY PROPERTYLaver and set theoryReverse mathematics, computability, and partitions of treesRamsey families of subtrees of the dyadic treeNotes on tree- and path-chromatic numberSeparating tree-chromatic number from path-chromatic numberAll those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)Comparing Dushnik-Miller dimension, Boolean dimension and local dimensionPartition theorems for factorizations of ascending parameter wordsDensity theorems for finitistic treesA dual form of Ramsey's theoremRamsey theory for countable binary homogeneous structuresInfinite partitions of random graphs



Cites Work