, Volume 14, Issue 1, pp 9-20

Set-Homogeneous Graphs and Embeddings of Total Orders

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.