Canonizing structural Ramsey theorems
From MaRDI portal
Abstract: At the beginning of 1950's ErdH os and Rado suggested the investigation of the Ramsey-type results where the number of colors is not finite. This marked the birth of the so-called canonizing Ramsey theory. In 1985 Pr"omel and Voigt made the first step towards the structural canonizing Ramsey theory when they proved the canonical Ramsey property for the class of finite linearly ordered hypergraphs, and the subclasses thereof defined by forbidden substructures. Building on their results in this paper we provide several new structural canonical Ramsey results. We prove the canonical Ramsey theorem for the class of all finite linearly ordered tournaments, the class of all finite posets with linear extensions and the class of all finite linearly ordered metric spaces. We conclude the paper with the canonical version of the celebrated Nev{s}etv{r}il-R"odl Theorem. In contrast to the "classical" Ramsey-theoretic approach, in this paper we advocate the use of category theory to manage the complexity of otherwise technically overwhelming proofs typical in canonical Ramsey theory.
Recommendations
Cites work
- A Combinatorial Theorem
- Canonizing Ramsey theorems for finite graphs and hypergraphs
- scientific article; zbMATH DE number 3902698 (Why is no real title available?)
- scientific article; zbMATH DE number 195102 (Why is no real title available?)
- scientific article; zbMATH DE number 863494 (Why is no real title available?)
- Metric spaces are Ramsey
- Models Without Indiscernibles
- Partitions of finite relational and set systems
- Ramsey classes of set systems
- Symmetry and the Ramsey degree of posets
- The partite construction and Ramsey set systems
- The Ramsey property for graphs with forbidden complete subgraphs
Cited in
(8)- Canonizing partition theorems: Diversification, products, and iterated versions
- A new proof of the Nešetřil-Rödl theorem
- Pre-adjunctions and the Ramsey property
- Colourful categories
- The canonical Ramsey theorem and computability theory
- Canonical forms of Borel-measurable mappings \(\Delta: [\omega]^\omega\to R\)
- Categorical view of the partite lemma in structural Ramsey theory
- A Ramsey theorem for structures with both relations and functions
This page was built for publication: Canonizing structural Ramsey theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1712518)