Conjecture 1 In the couples problem, if the acceptability graph is a tree, then a stable matching exists for any set of preference lists.