diff --git a/generalized_star_height_four_v2.txt b/generalized_star_height_four_v2.txt
index 0246d67..138e936 100644
--- a/generalized_star_height_four_v2.txt
+++ b/generalized_star_height_four_v2.txt
@@ -216,7 +216,14 @@ Suppose a finite
 family of events has a dependency graph of maximum degree D and each
 event has probability at most u (1 - u)^D for some 0 < u < 1. Then
 the simultaneous non-occurrence of every event has positive
-probability. The bound is proved by induction on the size of a
+probability. The paper's graph-explicit form implies this at
+u = 1/(2D).
+
+  From the paper, abbreviated: "Let G be a finite graph with maximum
+  degree d ... A_i is independent of {A_j : (v_i, v_j) in E(G)} ...
+  P(A_i) <= 1/(4d). Then P(A_1 ... A_n) > 0."
+
+The bound is proved by induction on the size of a
 conditioning set. For a set S of k events the induction claims:
 (a) every member of S fails simultaneously with positive
 probability, and (b) the conditional probability of any event A