Notation.

diff --git a/Makefile b/Makefile
index 0d0ac1d29a83d85febd8ffd8e0e355f31d66f3ff..1a19b1ee80307ba785a4fdefaa6c119168d360f9 100644 (file)
--- a/Makefile
+++ b/Makefile
@@ -1,6 +1,6 @@
 all: saga.ps
 
-CHAPTERS=cover mst
+CHAPTERS=cover mst notation
 
 %.dvi: %.tex macros.tex
        tex $< && if grep -q citation $*.aux ; then bibtex $* && tex $< && tex $< ; fi

diff --git a/mst.tex b/mst.tex
index 91f51d0ac1be5ae918dfb98588b06ecb57466428..baa178ea1e23987034acbb2acd5766320b6bde4c 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -59,7 +59,7 @@ First of all, let us show that the weights on edges are not necessary for the
 definition of the MST. We can formulate an equivalent characterization using
 an ordering of edges instead.
 
-\defnn{Heavy and light edges}
+\defnn{Heavy and light edges}\thmid{heavy}%
 Let~$T$ be a~spanning tree. Then:
 \itemize\ibull
 \:For vertices $x$ and $y$, let $T[x,y]$ denote the (unique) path in~$T$ joining $x$ and~$y$.

diff --git a/notation.tex b/notation.tex
new file mode 100644 (file)
index 0000000..134ce9f
--- /dev/null
+++ b/notation.tex
@@ -0,0 +1,20 @@
+\ifx\endpart\undefined
+\input macros.tex
+\fi
+
+\chapter{Notation}
+
+{\obeylines\parskip=0pt
+\def\n#1#2{\>\hbox to 6em{#1 \dotfill} #2}
+\def\[#1]{[\thmref{#1}]}
+\n{$T[x,y]$}{the path in a tree~$T$ joining $x$ and $y$ \[heavy]}
+\n{$T[e]$}{the path in a tree~$T$ joining endpoints of an~edge~$e$ \[heavy]}
+\n{$A\symdiff B$}{symetric difference of sets: $(A\setminus B) \cup (B\setminus A)$}
+\n{$G-e$}{graph $G$ with edge $e$ removed}
+\n{$G+e$}{graph $G$ with edge $e$ added}
+\n{$w(e)$}{weight of an edge $e$}
+\n{$V(G)$}{the set of vertices of a graph~$G$}
+\n{$E(G)$}{the set of edges of a graph~$G$}
+}
+
+\endpart

diff --git a/saga.tex b/saga.tex
index 4ea789cf78fa1b1f723c1438d7ee3c4d960a51f3..ca3f8489b65e7c57ccdb70cea3aadacb31660c62 100644 (file)
--- a/saga.tex
+++ b/saga.tex
@@ -4,6 +4,8 @@
 \input cover.tex
 \input mst.tex
 
+\input notation.tex
+
 \chapter{Bibliography}
 \dumpbib