Fixed bugs in notation.

diff --git a/notation.tex b/notation.tex
index e3016ae678a85d68567813a60d137a48725d8e3e..b53fdf18375dbb37eb26eda53e940b9acde6d894 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -33,7 +33,7 @@
 \n{MSF}{minimum spanning forest \[mstdef]}
 \n{$\mst(G)$}{the unique minimum spanning tree of a graph~$G$ \[mstnota]}
 \n{$\msf(G)$}{the unique minimum spanning forest of a graph~$G$ \[mstnota]}
-\n{$X \choose k$}{a set of all $k$-element subsets of a set~$X$}
+\n{$X \choose k$}{the set of all $k$-element subsets of a set~$X$}
 \n{$G/e$}{multigraph contraction \[contract]}
 \n{$G.e$}{simple graph contraction \[simpcont]}
 \n{$G/X$, $G.X$}{contraction by a~set $X$ of vertices or edges \[setcont]}
@@ -84,7 +84,7 @@
 \n{$D_n$}{the $n\times n$ matrix with $D[i,i]=0$ for all~$i$ and ones elsewhere else \[hatrank]}
 \n{$\per M$}{the permanent of a~square matrix~$M$}
 \n{$G\crpt R$}{graph~$G$ with edges in~$R$ corrupted \[corrnota]}
-\n{$R_C$}{$R_C = R\cup \delta(C)$ \[corrnota]}
+\n{$R^C$}{$R^C = R\cap \delta(C)$ \[corrnota]}
 \n{${\cal D}(G)$}{The optimal MSF decision tree for a~graph~$G$ \[decdef]}
 \n{$D(G)$}{The depth of ${\cal D}(G)$ \[decdef]}
 \n{$D(m,n)$}{Decision tree complexity of MSF \[decdef]}