Abstract
In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-edge-preserving. The research was motivated, a.o., by results from logic (concerning first order definability) and Constraint Satisfaction Problems.
We prove that for any finite set of objects B (finite relational Structures) there is a finite duality with B to the left. It appears that the surprising richness of these dualities leads to interesting problems of Ramsey type: this is what we explicitly analyze in the simplest case of graphs.