Set-Homogeneous Graphs and Embeddings of Total Orders
- Cite this article as:
- Droste, M., Giraudet, M. & Macpherson, D. Order (1997) 14: 9. doi:10.1023/A:1005880810385
- 44 Downloads
We construct uncountable graphs in which any two isomorphic subgraphs of size at most 3 can be carried one to the other by an automorphism of the graph, but in which some isomorphism between 2-element subsets does not extend to an automorphism. The corresponding phenomenon does not occur in the countable case. The construction uses a suitable construction of infinite homogeneous coloured chains.