Homogeneous Graph¶
A graph whose every isomorphism between finite induced subgraphs extends to an automorphism of the entire graph, making all finite local copies globally interchangeable.
Core Idea¶
A homogeneous graph is an undirected graph in which every isomorphism between finite induced subgraphs extends to an automorphism of the whole graph. Local sameness is therefore never accidental: any specified finite partial symmetry can be realized globally. In some graph-theory literature this stronger property is called ultrahomogeneity, while “(k)-homogeneous” may mean only that isomorphic (k)-vertex subgraphs lie in the same automorphism orbit.
The extension requirement is stronger than vertex-transitivity or ordinary symmetry because it preserves an entire finite partial mapping, not merely the type or location of one vertex.
Scope of Application¶
The property supports classification, permutation-group analysis, Fraïssé limits, and highly symmetric random structures. Gardiner classified the finite homogeneous graphs. Lachlan and Woodrow classified the countably infinite homogeneous undirected graphs, including the Rado graph, Henson graphs and complements, and disjoint unions of equal complete graphs and their complements.
Clarity¶
State whether subgraphs are induced, whether every finite size or only sizes at most (k) are tested, whether the given partial isomorphism itself must extend, and whether the graph is finite, countably infinite, directed, colored, or connected-homogeneous. Terminology varies enough that the quantifiers should replace the label when precision matters.
Manages Complexity¶
Homogeneity converts infinitely many possible local placements into automorphism equivalence. Once a finite configuration's isomorphism type is known, no additional global address is needed to decide whether it can be moved to another copy.
Abstract Reasoning¶
- Choose two finite induced subgraphs.
- Specify an explicit isomorphism between them.
- Treat that mapping as a finite partial automorphism.
- Determine whether it extends to a bijection of all vertices preserving adjacency.
- Repeat for all finite configurations or use a theorem reducing the test.
- Study the resulting automorphism group and orbit structure.
- For countable structures, compare the age and amalgamation properties.
- Apply the finite or countable classification under the exact hypotheses.
Knowledge Transfer¶
The portable pattern is every finite local equivalence must lift to a symmetry of the whole structure. It transfers to homogeneous relational structures and Fraïssé limits. The proposed immediate parent is Symmetry.
Relationships to Other Abstractions¶
Current abstraction Homogeneous Graph Domain-specific
Parents (1) — more general patterns this builds on
-
Homogeneous Graph is a kind of Symmetry Prime
Symmetry is the proposed immediate parent.
Hierarchy path (1) — routes to 1 parentless root
- Homogeneous Graph → Symmetry
Neighborhood in Abstraction Space¶
Homogeneous Graph sits in a sparse region of the domain-specific corpus (79th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Cage (Graph Theory) — 0.83
- Quotient Graph — 0.83
- Back-and-Forth Method — 0.83
- Age (Model Theory) — 0.82
- Multitree — 0.82
Computed from structural-signature embeddings · 2026-09-08