TY - JOUR
T1 - A partition theorem for scattered order types
AU - Komjáth, Péter
AU - Shelah, Saharon
PY - 2003/9
Y1 - 2003/9
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=2942515145&partnerID=8YFLogxK
U2 - 10.1017/S0963548303005686
DO - 10.1017/S0963548303005686
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:2942515145
SN - 0963-5483
VL - 12
SP - 621
EP - 626
JO - Combinatorics Probability and Computing
JF - Combinatorics Probability and Computing
IS - 5-6 SPEC. ISS.
ER -