A partition theorem for scattered order types

Péter Komjáth*, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

A partition theorem for scattered ordered types was presented. It was shown that given a target element and a cardinal for the number of colours, there is another element of the class which, when coloured with required numbers, always has a monocoloured copy of the target. It was also shown that for every scattered order type.φ and cardinal μ there exists a scattered order type ψ such that ψ→[φ]μ,ω1 holds. It was also shown that for every scattered order type φ and natural number n, there is a scatteed order type ψ such that ψ→(φ) n1 holds.

Original languageEnglish
Pages (from-to)621-626
Number of pages6
JournalCombinatorics Probability and Computing
Volume12
Issue number5-6 SPEC. ISS.
DOIs
StatePublished - Sep 2003

Fingerprint

Dive into the research topics of 'A partition theorem for scattered order types'. Together they form a unique fingerprint.

Cite this