From: Martin Mares <mj@ucw.cz>
Date: Thu, 17 Jan 2008 20:35:40 +0000 (+0100)
Subject: Minor fixes.
X-Git-Tag: printed~295
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=20da989f23229b81779e149317263b8a24823420;p=saga.git

Minor fixes.
---

diff --git a/biblio.bib b/biblio.bib
index 45d4595..71b6009 100644
--- a/biblio.bib
+++ b/biblio.bib
@@ -132,7 +132,7 @@
 }
 
 @article { jarnik:ojistem,
-    author = "Vojtech Jarn\'\i{}k",
+    author = "Vojt\v{e}ch Jarn\'\i{}k",
     title = "{O jist\'em probl\'emu minim\'aln\'\i{}m (About a Certain Minimal Problem)}",
     journal = "Pr\'ace mor. p\v{r}\'\i{}rodov\v{e}d. spol. v~Brn\v{e}",
     volume = "VI",
diff --git a/mst.tex b/mst.tex
index 62d571b..61ab3f8 100644
--- a/mst.tex
+++ b/mst.tex
@@ -26,6 +26,8 @@ For a given graph~$G$ with weights $w:E(G)\rightarrow {\bb R}$:
 \:A~subgraph $H\subseteq G$ is called a \df{spanning subgraph} if $V(H)=V(G)$.
 \:A~\df{spanning tree} of $G$ is any its spanning subgraph which is a tree.
 \:For any subgraph $H\subseteq G$ we define its \df{weight} $w(H):=\sum_{e\in E(H)} w(e)$.
+  When comparing two weights, we will use the terms \df{lighter} and \df{heavier} in the
+  obvious sense.
 \:A~\df{minimum spanning tree (MST)} of~$G$ is a spanning tree~$T$ such that its weight $w(T)$
   is the smallest possible of all the spanning trees of~$G$.
 \:For a disconnected graph, a \df{(minimum) spanning forest (MSF)} is defined as