Symmetry and the Ramsey Degrees of Finite Relational Structures

In this paper, we introduce a measure of the extent to which a finite combinatorial structure is a Ramsey object in the class of objects with a similar structure. We show for classes of finite relational structures, including graphs, binary posets, and bipartite graphs, how this measure depends on the symmetries of the structure.