Spelling checker strikes again.

[saga.git] / dyn.tex

diff --git a/dyn.tex b/dyn.tex
index c0d97e6bc2f1e7e907dff4f371802eb840e61cfc..629b2b85bf5b230e276dd7c69a4b9d8a1deb2c88 100644 (file)
--- a/dyn.tex
+++ b/dyn.tex
@@ -410,7 +410,7 @@ anyway.)
 }
 
 At the beginning, the graph contains no edges, so both invariants are trivially
-satistifed. Newly inserted edges can enter level~0, which cannot break I1 nor~I2.
+satisfied. Newly inserted edges can enter level~0, which cannot break I1 nor~I2.
 
 When we delete a~tree edge at level~$\ell$, we split a~tree~$T$ of~$F_\ell$ to two
 trees $T_1$ and~$T_2$. Without loss of generality, let us assume that $T_1$ is the