Lemma 3.1 (literal joins vs connected+dominating): 11082 pairs (graph, Y), n <= 6: OK
Prop 8.1: 1167 pairs (Gamma, v) with |V(Gamma)| <= 6; 50647 sets Y not in a join of Gamma^+: Y' not in a join of Gamma: OK
          and conversely: the sets not contained in a join of Gamma^+ are exactly the Y with r(Y) not in a join of Gamma: OK
Prop 8.3: 1254 pairs (Gamma, {v_1..v_s}) with |V(Gamma)| <= 5: adjacency description, independence of the order,
          and for 118925 sets Y not in a join of Gamma^+: r(Y) not in a join of Gamma: OK
          converse (Y not in a join <=> r(Y) not in a join) holds whenever Gamma has no isolated vertex; it fails in 277 cases with isolated vertices (not needed)
pentagon with two true twins of vertex 0 (7 vertices): vertices 0, 5, 6 pairwise adjacent: True -> three pairwise disjoint tori would be needed in one territory; not covered by Prop. 8.3 as printed
