Forbidden pairs combinatorics

We define a formalism, forbidden pairs problems, in which many combinatorial constructions can be expressed. The formalism highlights the basic nature of a large number of combinatorial constraints. We also define an algebraic-arithmetic problem to which all forbidden pairs problems can be PTIME reduced.