Ramsey properties for classes of relational systems
type: Item
instance of: scholarly article
title: Ramsey properties for classes of relational systems
zbMATH Open document ID: 0593.05052
DOI: 10.1016/S0195-6698(85)80049-4
published in: European Journal of Combinatorics
publication date: 1985-01-01T00:00:00Z
review text: A class \({\mathcal K}\) of relational systems (of the same type) has the R- Ramsey property if for every \(S\in {\mathcal K}\) there is \(T\in {\mathcal K}\) such that to every splitting of the class of all relational subsystems of T isomorphic to R into two blocks, there is a subsystem U of T isomorphic to S with all the restrictions of U isomorphic to R falling in the same block. The authors show this holds when (a) \({\mathcal K}\) is a class of finite reflexive relation systems closed under products and \(R\in {\mathcal K}\) is a singleton; (b) \({\mathcal K}\) is a class of finite relational systems closed under isomorphism and with the strong amalgamation property, and \(R\in {\mathcal K}\) is such that for every \(S\in {\mathcal K}\) the restrictions of S isomorphic to R are pairwise disjoint. These results extend work of \textit{J. Nešetřil} [Eur. J. Comb. 4, 143-147 (1983; Zbl 0524.08008)]. Finally they show that for \({\mathcal K}\) an isomorphism closed class of finite reflexive or areflexive relational systems with the strong amalgamation property and \(R\in {\mathcal K}\), if \({\mathcal K}\) has the R-Ramsey property then R is constant (i.e. \(\pi (\rho)=\pi\) for all permutations \(\pi\) of the base set and all relations \(\rho\) in R).
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 03C52
zbMATH DE Number: 3952820
zbMATH Keywords: relational systems
zbMATH Keywords: Ramsey property
author: Maurice Pouzet
author: Ivo G. Rosenberg
reviewed by: Neil H. Williams
MaRDI profile type: Publication
cites work: Q5341597
cites work: On chromatic number of graphs and set-systems
cites work: Q3230355
cites work: Ramsey's theorem for a class of categories
cites work: Q3903002
cites work: Regularity and Positional Games
cites work: Ramsey varieties
cites work: Homogeneous operations and homogeneous algebras
cites work: On a Probabilistic Graph-Theoretical Method
cites work: Q3671169
cites work: Graph multiplication
cites work: Q5617559
full work available at URL: s0195-6698(85)80049-4
OpenAlex ID: W2041408058
Recommended article: For graphs there are only four types of hereditary Ramsey classes
Recommended article: Indicators, chains, antichains, Ramsey property
Recommended article: The partite construction and Ramsey set systems
Recommended article: On Ramsey properties of classes with forbidden trees
Recommended article: Ramsey classes: examples and constructions
Recommended article: Rainbow Ramsey simple structures
Recommended article: Ramsey properties and extending partial automorphisms forhbox classes of finite structures
Recommended article: Ramsey Classes and Homogeneous Structures
Recommended article: New Ramsey classes from old
Recommended article: Ramsey degrees, labeled and unlabeled partitions
description: scientific article; zbMATH DE number 3952820