diff --git a/crossing_number_bipartite_v2.txt b/crossing_number_bipartite_v2.txt
index 961b1dd..c8fa66c 100644
--- a/crossing_number_bipartite_v2.txt
+++ b/crossing_number_bipartite_v2.txt
@@ -63,7 +63,7 @@ where C(n,2) = n(n-1)/2 is "n choose 2".
       THEOREM (Zarankiewicz conjecture).  For all m, n >= 1,
             cr(K_{m,n}) = d_m * d_n.
 
-The rest of the document proves this completely.
+
 
 2. THE d-SEQUENCE AND SMALL CASES