n=2 non-join graphs: 1 -> {'Theorem A + Prop 4.6': 1}
n=3 non-join graphs: 2 -> {'Theorem A + Prop 4.6': 2}
n=4 non-join graphs: 6 -> {'Theorem A + Prop 4.6': 4, 'Theorem A': 2}
n=5 non-join graphs: 21 -> {'Theorem A + Prop 4.6': 10, 'Theorem A': 7, 'A/B/joins + Prop 4.7 + Prop 4.6': 1, 'Theorem B': 2, "needs Theorem C (not verifier 1's part)": 1}
non-chordal non-join graphs on 5 vertices:
   [(0, 1), (0, 3), (1, 2), (2, 3)] -> A/B/joins + Prop 4.7 + Prop 4.6
   [(0, 1), (1, 3), (1, 4), (2, 3), (2, 4)] -> Theorem B
   [(0, 1), (0, 4), (1, 2), (2, 3), (3, 4)] -> needs Theorem C (not verifier 1's part)
   [(0, 1), (0, 3), (0, 4), (1, 2), (2, 3), (3, 4)] -> Theorem B
