Set-homogeneous graphs (Q1333326)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Set-homogeneous graphs |
scientific article; zbMATH DE number 638648
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set-homogeneous graphs |
scientific article; zbMATH DE number 638648 |
Statements
Set-homogeneous graphs (English)
0 references
13 September 1994
0 references
An infinite relational structure \(M\) is set-homogeneous if, whenever \(U\), \(V\) are finite isomorphic substructures of \(M\), there is an automorphism of \(M\) taking \(U\) to \(V\). This is a weakening of Fraïssé's notion of homogeneity. An example is given of a set-homogeneous graph which is not homogeneous, and the example is characterized by its symmetry properties. A variant of Fraïssé's amalgamation theorem is also given.
0 references
homogeneous structures
0 references
twisted amalgamation
0 references
set-homogeneous relational structure
0 references
set-homogeneous graph
0 references
