A Borel Ramsey theorem for strong similarity types of Fraïssé limits

Let K\mathcal{K} be a relational Fraïssé class with finitely many relations and a finite constraint set. Suppose that K\mathcal{K} satisfies the Ramsey property or has finite small Ramsey degrees. Let K\mathbb{K} be the Fraïssé limit of K\mathcal{K}, equipped with a linear order on its universe of order type ω\omega. Strong similarity type conjecture. There is some notion of strong similarity type such that the collection of all subcopies of K\mathbb{K} having the same strong similarity type has the property that all Borel subsets are Ramsey.

This conjecture seeks an infinite-dimensional Ramsey theorem for broad classes of Fraïssé limits, extending the role of strong coding trees in the known results for the Rado graph and Henson graphs. The source presents it as a prospective direction and gives no resolution.

Sources & referencesView supporting material

Primary source

Natasha Dobrinen, “Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees”, arXiv:1909.05985 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.