Finite Vertex-colored Ultrahomogeneous Oriented Graphs
<|reference_start|>Finite Vertex-colored Ultrahomogeneous Oriented Graphs: A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation and arbitrarily many unary relations. In other words, we classify the finite vertex-colored oriented ultrahomogeneous graphs. The classification comprises several general methods with which directed graphs can be combined or extended to create new ultrahomogeneous graphs. Together with explicitly given exceptions, we obtain exactly all vertex-colored oriented ultrahomogeneous graphs this way. Our main technique is a technical tool that characterizes precisely under which conditions two binary relational structures with disjoint unary relations can be combined to form a larger ultrahomogeneous structure.<|reference_end|>
@article{heinrich2024finite,
    title={Finite Vertex-colored Ultrahomogeneous Oriented Graphs},
    author={Irene Heinrich, Eda Kaja, and Pascal Schweitzer},
    journal={arXiv preprint arXiv:2408.07162},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.07162},
    primaryClass={math.CO cs.DM}
}