|
|
||
A structure is homogeneous if every partial isomorphism extends to an automorphism.
For example, every homogeneous graph is thus also edge and vertex transitive.
It is intuitively clear that such extremely symmetric structures are rare.
The classification programme of homogeneous structures is a project of giving
complete catalogs of homogeneous structures of given type (graphs, digraphs,
metric spaces etc.)
Last update: Kynčl Jan, doc. Mgr., Ph.D. (10.05.2018)
|
|
||
Cherlin, Gregory: Homogeneous Ordered Graphs and Metrically Homogeneous Graphs; Draft of the monograph: http://sites.math.rutgers.edu/~cherlin/Paper/inprep.html
Lachlan, Alistair H., and Robert E. Woodrow. "Countable ultrahomogeneous undirected graphs." Transactions of the American Mathematical Society (1980): 51-94.
Cherlin, Gregory, and Alistair H. Lachlan. "Stable finitely homogeneous structures." Transactions of the American Mathematical Society 296.2 (1986): 815-850.
Cherlin, Gregory L. "Homogeneous directed graphs." Finite and Infinite Combinatorics in Sets and Logic. Springer, Dordrecht, 1993. 81-95. Last update: Kynčl Jan, doc. Mgr., Ph.D. (10.05.2018)
|
|
||
In 2018/2019 we will focus on a new monograph by Cherlin, in particular on the chapter on classification of metrically homogeneous graphs. Last update: Kynčl Jan, doc. Mgr., Ph.D. (10.05.2018)
|