Author:
Brenner Sofia,Heinrich Irene
Abstract
We classify the countable ultrahomogeneous $2$-vertex-colored graphs in which the color classes form disjoint unions of cliques. This generalizes work by Jenkinson et.~al.~\cite{JEN12}, Lockett and Truss \cite{LOC14} as well as Rose~\cite{ROS11} on ultrahomogeneous $n$-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.
Reference15 articles.
1. P. J. Cameron. Homogeneous permutations. Electron. J. Combin., 9(2), 2002.
2. G. Cherlin. The classification of countable homogeneous directed graphs and countable n-tournaments, volume 621 of Mem. Amer. Math. Soc. Amer. Math. Soc., Providence, 1998.
3. A. Gardiner. Homogeneous graphs. J. Comb. Theory, Ser. B, 20(1):94-102, 1976.
4. Y. Golfand and M. Klin. On k-regular graphs. Algorithmic Research in Combinatorics, 186:76-85, 1978.
5. I. Heinrich, T. Schneider, and P. Schweitzer. Classification of finite highly regular vertex-coloured graphs. https://arxiv.org/abs/2012.01058.