Graph explorer

Colouring homogeneous structures

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.

3 nodes2 linksoverview previewColouring homogeneous structures
3 nodes2 links
Colouring homogeneous structures3 visible / 3 total nodes / 2 links
AuthorshipTopic signalWColouring homogeneous structurespreprint / 2020ANorbert SauerResearcherTmath.CO8936 works
PaperSignal 102 links

Colouring homogeneous structures

preprint / 2020

Open