The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
arXiv:1902.03126 · doi:10.1016/j.ejc.2019.103063
Abstract
We show that the independence number of a countably infinite HH-homogeneous graph that does not contain the Rado graph as a spanning subgraph is finite and present a classification of MB-homogeneous graphs up to bimorphism-equivalence as a consequence.
arXiv comment17 pages, 4 figures. To appear in the European Journal of Combinatorics
References in corpus (5)
- A unified approach to structural limits, and limits of graphs with bounded tree-depth
- Towards a Ryll-Nardzewski-type Theorem for weakly oligomorphic structures
- Some more notions of homomorphism-homogeneity
- Morphism extension classes of countable -colored graphs
- Two Fraïssé-style theorems for homomorphism-homogeneous relational structures