A tiny remark.

diff --git a/mst.tex b/mst.tex
index d61cecb3961cc41f820e1acf65d037e91b515632..51580d064e38e3f274cbc6d8ddb4bd8140481a61 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -157,7 +157,8 @@ and thus $T$~is also minimal.
 In general, a single graph can have many minimal spanning trees (for example
 a complete graph on~$n$ vertices and unit edge weights has $n^{n-2}$
 minimum spanning trees according to the Cayley's formula \cite{cayley:trees}).
-However, this is possible only if the weight function is not injective.
+However, as the following lemma shows, this is possible only if the weight
+function is not injective.
 
 \lemman{MST uniqueness}
 If all edge weights are distinct, then the minimum spanning tree is unique.