Set-homogeneous graphs (Q1333326): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1994.1055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982578185 / rank | |||
Normal rank | |||
Revision as of 19:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Set-homogeneous graphs |
scientific article |
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
