A Partition Theorem for Pairs of Finite Sets

DOI10.2307/2939283zbMATH Open0744.03048arXivmath/9201248OpenAlexW2951521427MaRDI QIDQ3986142FDOQ3986142

Authors: Thomas J. Jech, S. Shelah 

Publication date: 27 June 1992

Abstract: Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite character.

Full work available at URL: https://arxiv.org/abs/math/9201248

Recommendations

• Partitioning Pairs of Countable Sets
• Partition relations for partially ordered sets
• Partitions of the set of finite sequences
• scientific article; zbMATH DE number 3910448
• Directed Sets and Cofinal Types

zbMATH Keywords

cofinal subsetpartition theoremfinite characterpairs of finite setsdirected partially ordered setscofinal homogeneous set

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Consistency and independence results (03E35)

Cites Work

• Title not available (Why is that?)
• Some combinatorial problems concerning uncountable cardinals

Cited In (9)

• On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets
• A combination theorem for \(PD(n)\)-pairs
• Directed Sets and Cofinal Types
• Distributivity properties on \(P_{\omega}(\lambda)\)
• Common transversals for partitions of a finite set
• Title not available (Why is that?)
• Partitioning Pairs of Countable Sets
• A propos du choix du partenaire en aïkido : éléments d'algèbre et de combinatoire des appariements d'un ensemble fini
• A cofinal coloring theorem for partially ordered algebras

This page was built for publication: A Partition Theorem for Pairs of Finite Sets

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