Abstract
We prove the following theorem:
Let A be a finite structure in a fixed finite relational language,p 1,...,p m partial isomorphisms of A. Then there exists a finite structure B, and automorphismsf i of B extending thep i 's. This theorem can be used to prove the small index property for the random structure in this language. A special case of this theorem is, if A and B are hypergraphs. In addition we prove the theorem for the case of triangle free graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Cameron: Oligomorphic Permutation Groups, LMSLNS 152, Cambridge University Press, 1990.
E. Hrushovski: Extending Partial Isomorphisms of Graphs,Combinatorica 12 (1992), 411–416.
Hodges, Hodkinson, Lascar, Shelah: The Small Index Property for ω-stable, ω-categorical, structures and for the random graph,Journal of the LMS,48 (1993), 204–218.
J. K. Truss: Generic Automorphisms of Homogeneous Structures,Proceddings of the LMS (Ser. III),65 (1992), 121–141.