%PDF-1.5 % 1 0 obj << /S /GoTo /D (section.1) >> endobj 4 0 obj (1. Introduction) endobj 5 0 obj << /S /GoTo /D (section.2) >> endobj 8 0 obj (2. Notation and proof of Theorem 1.1) endobj 9 0 obj << /S /GoTo /D (subsection.2.1) >> endobj 12 0 obj (2.1. Notation) endobj 13 0 obj << /S /GoTo /D (subsection.2.2) >> endobj 16 0 obj (2.2. Overview of the proof of Theorem 1.1) endobj 17 0 obj << /S /GoTo /D (subsection.2.3) >> endobj 20 0 obj (2.3. Proof of Theorem 1.1) endobj 21 0 obj << /S /GoTo /D (section.3) >> endobj 24 0 obj (3. Useful results) endobj 25 0 obj << /S /GoTo /D (section.4) >> endobj 28 0 obj (4. Almost K4\205tiling) endobj 29 0 obj << /S /GoTo /D (section.5) >> endobj 32 0 obj (5. The absorbing lemma) endobj 33 0 obj << /S /GoTo /D (subsection.5.1) >> endobj 36 0 obj (5.1. There exists a vertex v V\(H\) such that v L\(e\) for very few edges e E\(H\).) endobj 37 0 obj << /S /GoTo /D (subsection.5.2) >> endobj 40 0 obj (5.2. Partitioning V\(H\) into \(c, \)-closed components.) endobj 41 0 obj << /S /GoTo /D (subsection.5.3) >> endobj 44 0 obj (5.3. Proof of Lemma 2.2) endobj 45 0 obj << /S /GoTo /D (subsection.5.4) >> endobj 48 0 obj (5.4. Proof of Lemma 5.10) endobj 49 0 obj << /S /GoTo /D (section.6) >> endobj 52 0 obj (6. The extremal case) endobj 53 0 obj << /S /GoTo /D (section.7) >> endobj 56 0 obj (7. Concluding remarks) endobj 57 0 obj << /S /GoTo /D (section*.1) >> endobj 60 0 obj (Acknowledgements) endobj 61 0 obj << /S /GoTo /D (section*.2) >> endobj 64 0 obj (References) endobj 65 0 obj << /S /GoTo /D [66 0 R /Fit] >> endobj 85 0 obj << /Length 4511 /Filter /FlateDecode >> stream xv}Bi7LO6K{W-fe%NWM `3 xX&Qf4,&dJ.V/.C:}}舆.ޝ;kg?B`2#9hid3&:rT3*ch֏Q9`7q:ԌDf C4kfθ N-LıyCh,x? )w/,8^~
;:/Ύ~8Ò?i0J: a/2Ԋ"&g^~2s,Ѓb@Bm'Atq9 L֕az04[
7UJfF]y0rBybB! H=#TFIB:di7aq.뢤=>2
M'>uB+
esʫ
XH\eqgUg{
hP^xfޯ%*.v lQ3Ԡ/-N"4<9ľB|"| X|f
ZKDdL`Vq=|(kl[وbEyKk$UQkGbIDc0}:Q4
9n
h%E07
jQPyOO:łkc;ace9b恦l&q0