Density theorems for finitistic trees

DOI10.1007/BF02579186MaRDI QIDQ786813zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

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

Cited in

(6)

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

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

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