A proof of a partition theorem for [ℚ]ⁿ

DOI10.1090/S0002-9939-02-06460-2zbMATH Open0991.05009OpenAlexW1542569653MaRDI QIDQ4536048FDOQ4536048

Authors: Vojkan Vuksanovic 

Publication date: 17 June 2002

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-02-06460-2

Recommendations

• A partition theorem for a large dense linear order
• A proof of Halpern-Läuchli partition theorem
• Borel partitions of infinite subtrees of a perfect tree
• Partition relations for partially ordered sets
• A canonical partition theorem for trees

zbMATH Keywords

partitions of rationals

Mathematics Subject Classification ID

Partitions of sets (05A18)

Cites Work

• A Partition Theorem
• A Ramsey theorem for trees

Cited In (4)

• A partition theorem for a large dense linear order
• Siblings of an \(\aleph_0\)-categorical relational structure
• Ramsey theory for countable binary homogeneous structures
• Counting canonical partitions in the random graph

This page was built for publication: A proof of a partition theorem for [ℚ]ⁿ

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