Colouring homogeneous structures
Combinatorics
2020-08-26 v2
Abstract
A relational structure is indivisible if for every partition of its set of elements into two parts there exists an embedding of the structure into one of the parts of the partition. A relational structure is homogeneous if every embedding of a finite induced substructure to a finite induced substructure extends to an automorphism. This article establishes a necessary and sufficient condition for Henson type, see [4], homogeneous structures to be indivisible.
Keywords
Cite
@article{arxiv.2008.02375,
title = {Colouring homogeneous structures},
author = {Norbert Sauer},
journal= {arXiv preprint arXiv:2008.02375},
year = {2020}
}