== Part A: Lemma 3.2 (cut-vertex counting, bound 2r-2)
  exhaustive: 33867 labelled graphs on <= 6 vertices, 69757 (graph, K) pairs checked
  max count by r: {1: 0, 2: 2, 3: 3, 4: 2, 5: 1, 6: 0}
  random: 48224 (graph, K) pairs on 7..12 vertices; max count by r: {2: 2, 3: 4, 4: 5, 5: 6, 6: 6, 7: 5, 8: 4, 9: 3, 10: 2, 11: 1, 12: 0}
  tightness: the path K-Z-Z-K-...-K gives count exactly 2r-2 for r = 1..8
== Part B: Lemma 3.3 for every admissible H (arbitrary graphs, no density)
  942 feasible instances, 98670 (instance, H) pairs; min over instances of (min_H bound - max_Y* |Y* cap D|) = 0
== Part C: Lemma 3.1 and Theorem 3.4 (c = |H'| + 2r - 2) on eps-dense instances
  instances: {'rand': 70, 'clus': 30}; optimal sets checked against Lemma 3.3: 386; largest opt = 11
  Theorem 3.4 algorithm (from-scratch Dreyfus-Wagner) equals the brute-force optimum on all 100
== Part D: reduction (Lemmas 4.1, 4.3, 4.4 and the chain)
  Lemma 4.1 q=2 d=1: degree [1], covering number 1 (exhaustive)
  Lemma 4.1 q=2 d=2: degree [2], covering number 2 (exhaustive)
  Lemma 4.1 q=2 d=3: degree [4], covering number 3 (exhaustive)
  Lemma 4.1 q=2 d=4: degree [8], covering number 4 (exhaustive)
  Lemma 4.1 q=3 d=1: degree [2], covering number 1 (exhaustive)
  Lemma 4.1 q=3 d=2: degree [6], covering number 2 (exhaustive)
  Lemma 4.1 q=3 d=3: degree [18], covering number 3 (exhaustive)
  Lemma 4.1 q=5 d=2: degree [20], covering number 2 (exhaustive)
  Lemma 4.1 q=7 d=2: degree [42], covering number 2 (no (d-1)-cover, basis covers)
  Lemma 4.3: 35 instances (eps in {0.3, 0.6, 0.75}); density >= eps and opt = min(tau, d) on all
  chain 3-SAT -> Set Cover (k=2 blocks) -> 0.3-dense Steiner (q=2, d=3): 24 formulas (20 satisfiable), opt <= k iff satisfiable on all
TOTAL failures = 0; time 15.3s
