Extending partial isomorphisms for the small index property of many ω-categorical structures

Theorem:Let A be a finite K _m -free graph, p ₁ , …, p _n partial isomorphisms on A. Then there exists a finite extension B, which is also a K _m -free graph, and automorphisms f _i of B extending the p _i . A paper by Hodges, Hodkinson, Lascar and Shelah shows how this theorem can be used to prove the small index property for the generic countable graph of this class. The same method also works for a certain class of continuum many non-isomorphic ω-categorical countable digraphs and more generally for structures in an arbitrary finite relational language, which are built in a similar fashion. Hrushovski proved this theorem for the class of all finite graphs Hr]; the proof presented here stems from his proof. Supported by EC-grant ERBCHBGCT 920013.