Relationship between strictly collapsible and perfect contingency tables

Whittemore (1978) conjectured that an N-dimensional contingency table p is strictly collapsible over each factor with respect to the set of remaining factors if and only if p has a certain factorization. I prove this conjecture for N = 3 and show by counterexamples that it is false for N> 3.