Bug fix.

diff --git a/mst.tex b/mst.tex
index 6e6310bb692af3182283c51cde53caf1acdcede9..7c533c1aa1237b21495f90c492e1f005218bbdef 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -545,7 +545,7 @@ the identifier of the component. This takes $\O(m_i)$ time.
 
 Flattening is performed by first removing the loops and then bucket-sorting the edges
 (as ordered pairs of vertex identifiers) lexicographically, which brings parallel
-edges together. The bucket sort uses two passes with $n$~buckets, so it takes
+edges together. The bucket sort uses two passes with $n_i$~buckets, so it takes
 $\O(n_i+m_i)=\O(m)$.
 \qed