Abstract
This paper investigates to what extent, the Milliken partition theorem for finitistic trees is a density result.
Similar content being viewed by others
References
T. C. Brown andJ. P. Buhler, A density version of a geometric Ramsey theorem,JCT(A) 32 (1982), 20–34.
P. Erdős andD. Kleitman. On collections of subsets containing no 4-member Boolean algebra,Proc. AMS 28 (1971), 87–90.
H. Fürstenberg andY. Katznelson, An ergodic Szemerédi theorem for commuting transformations,Journal d’Analyse Mathematique 34 (1978), 275–291.
J. D. Halpern andM. Läuchli, A partition theorem,Trans. AMS 124 (1966), 360–367.
K. Milliken, A Ramsey theorem for trees,JCT(A) 26 (1979), 215–237.
V. Rödl, A note on finite Boolean algebras,Acta Polytechnica, Práce CVUT v Praze, Vedecká Konference 1982.
E. Sperner, Ein Satz über Untermengen einer endlichen Menge,Math. Zeitschrift 27 (1928), 544–548.
E. Szemerédi, On sets of integers containing nok elements in arithmetic progression,Acta Arith. 27 (1975), 199–245.
Author information
Authors and Affiliations
Additional information
Dedicated to Paul Erdős on his seventieth birthday