Partitioning subsets of generalised scattered orders

Chris Lambie-hanson, Thilo Weinert

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

In 1956, 48 years after Hausdorff provided a comprehensive account on ordered sets and defined the notion of a scattered order, Erdos and Rado founded the partition calculus in a seminal paper. The present paper gives an account of investigations into generalisations of scattered linear orders and their partition relations for both singletons and pairs. We consider analogues for these order-types of known partition theorems for ordinals or scattered orders and prove a partition theorem from assumptions about cardinal characteristics. Together, this continues older research by Erdos, Galvin, Hajnal, Larson and Takahashi and more recent investigations by Abraham, Bonnet, Cummings, Džamonja, Komjáth, Shelah and Thompson.

Original languageEnglish
Pages (from-to)253-257
Number of pages5
JournalJournal of the Mathematical Society of Japan
Volume71
DOIs
StatePublished - 1 Jan 2019
Externally publishedYes

Keywords

  • Graph
  • Linear order
  • Partition relation
  • Ramsey theory
  • Scattered order
  • Stick
  • Unbounding number

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Partitioning subsets of generalised scattered orders'. Together they form a unique fingerprint.

Cite this