simply take two relations R(A,B,C) and S(D,E)and apply full outer join with D=E and suppose nothing is equal then obviously it will be converted to cartesian product,so maximum number of tuples will be m*n.
second case when in all the cases D=E then we will get in one of the relations all the tuples matched and remaining tuples from other relation then minimum number of tuples will be MAX(m,n).