“…Let f (x) and g(y) be polynomials of positive degrees in different variables x, y such that f (x) − g(y) is reducible over K. If f = f (1) • f (2) and g = g (1) • g (2) are any decompositions of f, g over K, then it is clear that a proper factor P (1) (1) (y) over K gives rise to a proper factor P (x, y) = P (1) (f (2) (x), g (2) (y)) of f (x) − g(y). In this paper we show that there are best possible decompositions f = f (1) • f (2) , g = g (1) • g (2) over K, which are unique up to linear equivalence, such that a factor P (x, y) of f (x) − g(y) is irreducible over K if and only if P (x, y) can be written as P (1) (f (2) (x), g (2) (y)) for some irreducible factor P (1) (1) (y); moreover f (1) (x) and g (1) (y) are of the same degree, provided these degrees are not divisible by the characteristic of K. Indeed, we prove:…”