%PDF-1.4
%
4 0 obj
<< /S /GoTo /D (section.1) >>
endobj
7 0 obj
(1. Introduction)
endobj
8 0 obj
<< /S /GoTo /D (section.2) >>
endobj
11 0 obj
(2. Overview of the proof)
endobj
12 0 obj
<< /S /GoTo /D (subsection.2.1) >>
endobj
15 0 obj
(2.1. An approximate version of P\363sa's conjecture)
endobj
16 0 obj
<< /S /GoTo /D (subsection.2.2) >>
endobj
19 0 obj
(2.2. A degree sequence version of P\363sa's conjecture)
endobj
20 0 obj
<< /S /GoTo /D (section.3) >>
endobj
23 0 obj
(3. Extremal examples for Theorem ??)
endobj
24 0 obj
<< /S /GoTo /D (section.4) >>
endobj
27 0 obj
(4. Preliminaries)
endobj
28 0 obj
<< /S /GoTo /D (subsection.4.1) >>
endobj
31 0 obj
(4.1. Notation)
endobj
32 0 obj
<< /S /GoTo /D (subsection.4.2) >>
endobj
35 0 obj
(4.2. The Regularity and Blow-up lemmas)
endobj
36 0 obj
<< /S /GoTo /D (subsection.4.3) >>
endobj
39 0 obj
(4.3. -good degree sequences)
endobj
40 0 obj
<< /S /GoTo /D (subsection.4.4) >>
endobj
43 0 obj
(4.4. Core degree)
endobj
44 0 obj
<< /S /GoTo /D (section.5) >>
endobj
47 0 obj
(5. An almost perfect packing of heavy square paths)
endobj
48 0 obj
<< /S /GoTo /D (subsection.5.1) >>
endobj
51 0 obj
(5.1. Folded paths)
endobj
52 0 obj
<< /S /GoTo /D (subsection.5.2) >>
endobj
55 0 obj
(5.2. Embedding a square path into a folded path)
endobj
56 0 obj
<< /S /GoTo /D (subsection.5.3) >>
endobj
59 0 obj
(5.3. Finding a folded path in an -good graph)
endobj
60 0 obj
<< /S /GoTo /D (subsection.5.4) >>
endobj
63 0 obj
(5.4. The proof of Lemma ??)
endobj
64 0 obj
<< /S /GoTo /D (section.6) >>
endobj
67 0 obj
(6. Connecting heavy square paths into an almost spanning square cycle)
endobj
68 0 obj
<< /S /GoTo /D (subsection.6.1) >>
endobj
71 0 obj
(6.1. Finding flexible square paths)
endobj
72 0 obj
<< /S /GoTo /D (subsection.6.2) >>
endobj
75 0 obj
(6.2. Connecting flexible square paths)
endobj
76 0 obj
<< /S /GoTo /D (subsection.6.3) >>
endobj
79 0 obj
(6.3. An almost spanning square cycle)
endobj
80 0 obj
<< /S /GoTo /D (section.7) >>
endobj
83 0 obj
(7. An almost spanning triangle cycle)
endobj
84 0 obj
<< /S /GoTo /D (section.8) >>
endobj
87 0 obj
(8. The square of a Hamilton cycle)
endobj
88 0 obj
<< /S /GoTo /D (subsection.8.1) >>
endobj
91 0 obj
(8.1. Cycle structures)
endobj
92 0 obj
<< /S /GoTo /D (subsection.8.2) >>
endobj
95 0 obj
(8.2. Embedding the square of a Hamilton cycle)
endobj
96 0 obj
<< /S /GoTo /D (section.9) >>
endobj
99 0 obj
(9. Proof of Theorem ??)
endobj
100 0 obj
<< /S /GoTo /D (section.10) >>
endobj
103 0 obj
(10. Concluding remarks)
endobj
104 0 obj
<< /S /GoTo /D (section*.1) >>
endobj
107 0 obj
(Acknowledgements)
endobj
108 0 obj
<< /S /GoTo /D (section*.2) >>
endobj
111 0 obj
(References)
endobj
112 0 obj
<< /S /GoTo /D [113 0 R /Fit ] >>
endobj
133 0 obj <<
/Length 4083
/Filter /FlateDecode
>>
stream
x[s_&i;:4[iDkI;Q^w(ʝEb]v_|Zfޞ-wW_\`g.~4ٻ՛i74i9wg>.ao+&rX
żvm_|s/b)=s.3#7.VهK:-=
/N/^w&wge;Y&:͌u㹧uϯv_IZ6{{µ<1<)\} g
\3#tV7E|m_o%|.U4Mo#hU|&}Vv_Q!q)]t.;6)xf&Dm*nk4Dq}ZX^9m]EԱ.oem!ط)&6e[86c]X]䶛njPO{n~::omiUڔli.ʞp )МI(ßqb 5M٦ߖNva}N=HzRo7#y 2>]_m<_mGZav&+M(l776{l惘^/ϖ4+EU S`):U|ZT(6wb_49ėp)9S7R .ȑ)X34(fOMSK+#:t7n\
˴;H52*k8\v6OcVj0Y
4zn跠SjVq^Fj@$N \q]-H7Ƭ5%H4K,LJ\cayZ4
3J3en|5E[5pl.Un@-?Ke̤b
M>؊"@kq?k{eKA4SļT#R)i7+Yݳ\%(eir &qzFm~Z6Ra<'+RQBzj]ӂǍ5 [|k8Ic̺sꦩ'X;<8{
} 3|p. 6Ǹw xª
>M{ߖ](Iw;'v^ 5F,oa4〡98 x* d7vP^V@ėే
ewrͶ5",9ŶhC9l;ݗ i$uB|j_hFu\WZwQc`}_`[A .x㒰SXF!WY
`G^ޝgt
; 1S8sfz:_lXKf`/v 3lq(lTkR4rS$昱vv{t@:eR=Zs!q//
uoz99Qu8M\doZ
spe:gLGq焹sֺ&DCࠃXDt| geJJ3K*i>zdL|ΤՑ{D5QB SC|k/,Pč~% lE
XYvsρE{َRS ~I3D"D
|TNXCē{X&c
iv5lOOٳ$Ω^5lQ
[xLDsѐj]催ooâ9iG ҄b/5FN%jT`4YF6ކ<XD_(")z
Kϱ'CbeԲξ6t±\^:9XL 1Ĩ}!tcZ=s