The poset of morphism-extension classes of countable graphs
From MaRDI portal
Abstract: Let denote the class of countably infinite -structures that satisfy the axioms and in which all homomorphisms of type X (these could be homomorphisms, monomorphisms, or isomorphisms) between finite substructures of are restrictions of an endomorphism of of type Y (for example, an automorphism or a surjective endomorphism). Lockett and Truss introduced 18 such morphism-extension classes for relational structures. For a given pair , however, two or more morphism-extension properties may define the same class of structures. In this paper, we establish all equalities and inequalities between morphism-extension classes of countable (undirected, loopless) graphs.
Recommendations
Cites work
- A survey of homogeneous structures
- Countable Ultrahomogeneous Undirected Graphs
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Homomorphism-homogeneous graphs
- Homomorphism-Homogeneous Relational Structures
- scientific article; zbMATH DE number 5657589 (Why is no real title available?)
- scientific article; zbMATH DE number 1064592 (Why is no real title available?)
- scientific article; zbMATH DE number 3080680 (Why is no real title available?)
- On polymorphism-homogeneous relational structures and their clones.
- Permutation monoids and MB-homogeneity for graphs and relational structures
- Ramsey Classes and Homogeneous Structures
- Some more notions of homomorphism-homogeneity
- The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
Cited in
(3)
This page was built for publication: The poset of morphism-extension classes of countable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144624)