diff --git a/crossing_number_bipartite_v2.txt b/crossing_number_bipartite_v2.txt
index 1e797f3..11de3c6 100644
--- a/crossing_number_bipartite_v2.txt
+++ b/crossing_number_bipartite_v2.txt
@@ -18,39 +18,7 @@ CONTENTS
  Part X    Further reading              Section 19
 
 ==============================================================================
-HOW TO READ THIS DOCUMENT
-==============================================================================
-
- The argument is long but each piece is simple.  Suggested reading order
- for a high school student:
-
-   First pass (the whole idea in a page):
-     Sections 1-5.  Learn the problem, the easy upper bound, and the
-     plan for the hard lower bound.  Do NOT get bogged down.
-
-   Second pass (the tools):
-     Sections 6-8 (linear algebra).  These are self-contained; no
-     background is required.  Then Sections 9-12 (geometry).  The
-     proofs here are wordy but picture-driven.
-
-   Third pass (the crown jewel):
-     Sections 13-15 (the "rank detector").  This is where Lagrange
-     interpolation meets two-triangle combinatorics.  Read the easier
-     case s=1 first (n=3), then s=2 (n=5), then general s.
-
-   Final pass (assembly):
-     Sections 16-17.  The three tools click together into the theorem.
-
- Sections 18-19 (normalization and references) can be skimmed on first
- reading; they back up technical claims that a first-time reader may
- reasonably take on faith.
 
- Key checkpoints to test understanding:
-   Section  3:  do you see why cr(K_3,3) = 1?
-   Section  4:  do you believe cr <= d_m d_n?
-   Section  5:  can you state the three ingredients in your own words?
-   Section  8:  can you plug in m=2,3,4 and verify the numbers?
-   Section 16.6: can you see where each inequality goes?
 
 ==============================================================================
 PART I   SETTING THE SCENE