A proof of a partition theorem for [ℚ]ⁿ

DOI10.1090/S0002-9939-02-06460-2zbMath0991.05009OpenAlexW1542569653MaRDI QIDQ4536048

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

zbMATH Keywords

partitions of rationals

Mathematics Subject Classification ID

Partitions of sets (05A18)

Related Items

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

Cites Work

• A Ramsey theorem for trees
• A Partition Theorem