Density theorems for finitistic trees

DOI10.1007/BF02579186zbMath0528.05002OpenAlexW2083347412MaRDI QIDQ786813

Ralf Bicker, Bernd Voigt

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579186

zbMATH Keywords

finitistic treeMilliken partition theorempositive upper densitystrongly embedded subtree

Mathematics Subject Classification ID

Partial orders, general (06A06) Trees (05C05) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Related Items (6)

Upper bounds for a Ramsey theorem for trees ⋮ Operators on the stopping time space ⋮ A density version of the Halpern-Läuchli theorem ⋮ A density version of the Carlson-Simpson theorem ⋮ Measurable events indexed by products of trees ⋮ Symmetries and Ramsey properties of trees

Cites Work

• An ergodic Szemerédi theorem for commuting transformations
• A Ramsey theorem for trees
• A density version of a geometric Ramsey theorem
• On sets of integers containing k elements in arithmetic progression
• A Partition Theorem
• On Collections of Subsets Containing No 4-Member Boolean Algebra

This page was built for publication: Density theorems for finitistic trees