Clarify notation.

diff --git a/rank.tex b/rank.tex
index 082204a88dd445037e3acf8a6392ca279a394f2d..b4b8ffebd0de6ccb00c282875c08264b17892855 100644 (file)
--- a/rank.tex
+++ b/rank.tex
@@ -430,7 +430,8 @@ determine whether there exists at least one permutation satisfying a~given set o
 
 \thm
 There is an~algorithm which decides in time $\O(n^{1/2}\cdot m)$ whether there exists
-a~permutation satisfying a~given restriction graph.
+a~permutation satisfying a~given restriction graph. The $n$ and~$m$ are the number
+of vertices and edges of the restriction graph.
 
 \proof
 It is sufficient to verify that there exists a~perfect matching in the