Notation.

diff --git a/mst.tex b/mst.tex
index 848d61ac900e6a0be13cd1b01e64781aefeb6dd7..8eb0baf7be0f7d4d238b0233f0c88608f2c96aba 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -666,7 +666,7 @@ Non-trivial minor-closed classes include planar graphs and more generally graphs
 embeddable in any fixed surface. Many nice properties of planar graphs extend
 to these classes, too, most notable the linearity of the number of edges.
 
-\defn
+\defn\thmid{density}%
 Let $\cal C$ be a class of graphs. We define its \df{edge density} $\varrho(\cal C)$
 to be the infimum of all~$\varrho$'s such that $\vert E(G) \vert \le \varrho\cdot\vert V(G)\vert$
 holds for every $G\in\cal C$.

diff --git a/notation.tex b/notation.tex
index cd7f8dd4101f1641030de2e1d0d66378f0e05b46..59552c9f3d66d6d750c4f1ce4ede511e7e87cbe0 100644 (file)
--- a/notation.tex
+++ b/notation.tex
@@ -26,6 +26,7 @@
 \n{$G.e$}{simple graph contraction \[simpcont]}
 \n{$\alpha(n)$}{the inverse Ackermann's function}
 \n{$f[X]$}{function applied to a set: $f[X]:=\{ f(x) ; x\in X \}$.}
+\n{$\varrho({\cal C})$}{edge density of a graph class~$\cal C$ \[density]}
 }
 
 \section{Multigraphs and contractions}