%PDF-1.4 % 5 0 obj << /S /GoTo /D (34section.1) >> endobj 8 0 obj (1. Introduction) endobj 9 0 obj << /S /GoTo /D (34section.4) >> endobj 12 0 obj (2. The complex of curves) endobj 13 0 obj << /S /GoTo /D (34section.7) >> endobj 16 0 obj (3. Train tracks) endobj 17 0 obj << /S /GoTo /D (34section*.9) >> endobj 20 0 obj (The nesting lemma of Masur and Minsky) endobj 21 0 obj << /S /GoTo /D (34section.14) >> endobj 24 0 obj (4. The Bestvina--Handel algorithm) endobj 25 0 obj << /S /GoTo /D (34section.23) >> endobj 28 0 obj (5. Lower bounds) endobj 29 0 obj << /S /GoTo /D (34section.31) >> endobj 32 0 obj (6. Upper bound) endobj 33 0 obj << /S /GoTo /D (34section*.44) >> endobj 36 0 obj (References) endobj 37 0 obj << /S /GoTo /D [38 0 R /FitBH ] >> endobj 44 0 obj << /Length 3030 /Filter /FlateDecode >> stream xZY~_jݤF;HGhH,R;>ncH6(m2棯JRj4Dx^gon*Q)"0byb)TOʒP6Na)&t{teEL/)Z,;(yǹf!9PKWLJI"h)(%%ȴT[8~4mn/>mwFnx8Tmkn7CȐY-&'Ȇݬ~[{?x<5geCmӒY*ǾanӔYA7atT٧k}ƍ +6˹% "9O²9˗sh2Ac+2V' j6W|^]D_WT~/,pӹ@\?;'eB`( 2J۱0e*5PmM~u^Y1g0]FiY+IJ0̋])=S sS@jPs+ZV >- =_{Q" a!;_g:U"3Ypʤ$c357u{(]hO!`(e%2 edX݂= ';뛡Yp<7Z0vxV~^(x LAĈ