Let $\sigma$ be a finite relational signature, let $\mathcal T$ be a set of finite complete relational structures of signature $\sigma$, and let ${\rm H}_{\mathcal T}$ be the countable homogeneous relational structure of signature $\sigma$ which does not embed any of the structures in $\mathcal T$.When $\sigma$ consists of at most binary relations and $\mathcal T$ is finite, the vertex partition behaviour of ${\rm H}_{\mathcal T}$ is completely analysed, in the sense that it is shown that a canonical partition exists and the size of this partition in terms of the structures in $\mathcal{T}$ is determined. If $\mathcal{T}$ is infinite some results are obtained, but a complete analysis is still missing.Some general results are presented which are intended to be used in further investigations when $\sigma$ contains relational symbols of arity larger than two or when the set of bounds $\mathcal{T}$ is infinite.
[1]
Norbert Sauer,et al.
Ramsey-type properties of relational structures
,
1991,
Discret. Math..
[2]
Norbert Sauer.
Edge partitions of the countable triangle free homogeneous graph
,
1998,
Discret. Math..
[3]
Norbert Sauer,et al.
On the divisibility of homogeneous directed graphs
,
1993
.
[4]
Norbert Sauer.
A Ramsey theorem for countable homogeneous directed graphs
,
2002,
Discret. Math..
[5]
Partition Theorems for Graphs Respecting the Chromatic Number
,
1990
.
[6]
R. P. Dilworth,et al.
A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS
,
1950
.
[7]
Norbert Sauer,et al.
The indivisibility of the homogeneous Kn-free graphs
,
1989,
J. Comb. Theory, Ser. B.
[8]
Combinatorics Springer-Verlag.
Coloring of Universal Graphs
,
1986
.