Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T09:30:17.496Z Has data issue: false hasContentIssue false

Homogeneous graphs and stability

Published online by Cambridge University Press:  09 April 2009

A. Gardiner
Affiliation:
Pure Mathematics, University of Birmingham, Birmingham B15 2TT, England.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let Γ be a graph with finite vertex set V. Γ is homogeneous if whenever U1, U2 ⊆ V are such that the vertex subgraphs (U1), (U2) are isomorphic, then every isomorphism from (U1) to (U2) extends to an automorphism of Γ; homogeneous graphs were studied by Sheehan (1974) and were classified by the author. Γ is locally homogeneous if whenever U ⊆ V, then every automorphism of (U) extends to an automorphism of Γ. We prove that every locally homogeneous graph is homogeneous.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1976