A proof of Halpern-Läuchli partition theorem

European Journal of Combinatorics

Volumn 23, Issue 1, 2002, Pages 1-10

  Argyros, S A ^a   Felouzis, V ^b   Kanellopoulos, V ^c  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF CRETE   (Greece)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036111262     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2001.0542     Document Type: Article

References (5)

1. J. D. Halpern, Nonstandard combinatorics, Proc. London Math. Soc., (1975), 40 54.
2. J. D. Halpern and H. Läuchli, A partition theorem, Trans. Am. Math. Soc., 124 (1966), 360-367.
3. A. Louveau, S. Shelah and B. Veličković, Borel partitions of infinite subtrees of a perfect tree, Annals of Pure and Applied Logic, 63 (1993), 271-281.
4. K. R. Milliken, A Ramsey theorem for trees, J. Comb. Theory A, 26 (1979), 215-237.
5. D. Pincus and J. D. Halpern, Partitions of products, Trans. Am. Math. Soc., 267 (1981), 549-568.