Corpus ID: 202540095

IB-homogeneous graphs

@article{Aranda2019IBhomogeneousG,
  title={IB-homogeneous graphs},
  author={Andr{\'e}s Aranda},
  journal={arXiv: Combinatorics},
  year={2019}
}
  • Andrés Aranda
  • Published 2019
  • Mathematics
  • arXiv: Combinatorics
  • The Lachlan-Woodrow Theorem identifies ultrahomogeneous graphs up to isomorphism. Recently, the present author and D. Hartman classified MB-homogeneous graphs up to bimorphism-equivalence. We extend those results in this paper, showing that every IB-homogeneous graph is either ultrahomogeneous or MB-homogeneous, and thus all the IB-homogeneous graphs are known up to bimorphism-equivalence. 

    Figures from this paper.

    The poset of morphism-extension classes of countable graphs

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
    5
    Some more notions of homomorphism-homogeneity
    10
    Homomorphism-Homogeneous Relational Structures
    64
    The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous N-Tournaments
    162
    Countable ultrahomogeneous undirected graphs
    202
    Two Fraïssé-style theorems for homomorphismhomogeneous relational structures, arXiv preprint arXiv:1812.01934
    • 1934