From f63acfb484f66e60bc40521f57327c292ff924b4 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Mon, 5 May 2008 00:00:33 +0200
Subject: [PATCH] Clarify notation.

---
 rank.tex | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/rank.tex b/rank.tex
index 082204a..b4b8ffe 100644
--- 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
-- 
2.39.2