A proof of Halpern-Läuchli partition theorem

DOI10.1006/EUJC.2001.0542zbMath0997.05025OpenAlexW2068608446MaRDI QIDQ1348762

V. Felouzis, Vassilis Kanellopoulos, Spiros A. Argyros

Publication date: 17 November 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2001.0542

zbMATH Keywords

Halpern-Läuchli partition theorempartitions of finite products of trees

Mathematics Subject Classification ID

Trees (05C05) Partitions of sets (05A18) Other combinatorial set theory (03E05)

Related Items (4)

A disjoint unions theorem for trees ⋮ Bounds on trees ⋮ Unconditional families in Banach spaces ⋮ Ramsey families of subtrees of the dyadic tree

Cites Work

• Borel partitions of infinite subtrees of a perfect tree
• A Ramsey theorem for trees
• Partitions of Products
• Nonstandard Combinatorics
• A Partition Theorem

This page was built for publication: A proof of Halpern-Läuchli partition theorem