Countable ultrahomogeneous graphs on two imprimitive color classes
From MaRDI portal
Abstract: We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well as Rose on ultrahomogeneous -graphs. As the key aspect in such a classification, we identify a concept called piecewise ultrahomogeneity. We prove that there are two specific graphs whose occurrence essentially dictates whether a graph is piecewise ultrahomogeneous, and we exploit this fact to prove the classification.
This page was built for publication: Countable ultrahomogeneous graphs on two imprimitive color classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440424)
