Set-homogeneous graphs and embeddings of total orders (Q1368660): 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.1023/a:1005880810385 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W181878848 / rank | |||
Normal rank |
Latest revision as of 11:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Set-homogeneous graphs and embeddings of total orders |
scientific article |
Statements
Set-homogeneous graphs and embeddings of total orders (English)
0 references
11 December 1997
0 references
A construction is given, for any uncountable cardinal \(\kappa\), of a graph such that any two isomorphic subgraphs of size at most 3 are in the same orbit of the automorphism group (on unordered subsets), but some isomorphism between 2-element subsets does not extend to an automorphism. It was shown earlier by \textit{M. Droste}, \textit{M. Giraudet}, \textit{D. Macpherson}, and \textit{N. Sauer} in [Set-homogeneous graphs, J. Comb. Theory, Ser. B 62, 63-95 (1994; Zbl 0799.03034)] that up to elementary equivalence there were at most four such graphs (two complementary pairs), but it was not known whether all these theories gave examples. The graphs are closely related to circular orders, and hence to total orders. In the proof, certain countable homogeneous coloured totally ordered sets, with special additional properties, are constructed.
0 references
\(k\)-homogeneous graphs
0 references
homogeneous chains
0 references
linear orderings
0 references