hw5: Fix problem statement

Lipen · Mar 5, 2024 · 44813bd · 44813bd
1 parent 237e09d
commit 44813bd
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/hw5.tex b/hw5.tex
@@ -370,7 +370,7 @@
 
     \item Consider a graph of subway lines in Saint Petersburg in 2050\Href{https://web.archive.org/web/20240301072159/https://commons.wikimedia.org/wiki/File:Saint_Petersburg_metro_future_map_RUS.png}.
     Smoothen out all vertices, i.e. retain only transfer and final stations.
-    Find all cut vertices and bridges, blocks and islands, maximum stable set, maximum matching, minimum dominating set, minimum vertex cover, minimum edge cover.
+    Find all cut vertices and bridges, blocks and islands, maximum stable set, maximum matching, minimum dominating set, minimum vertex and edge covers.
 
 
     \item Find an error in the following inductive \enquote{proof} of the statement that every tree with $n$ vertices has a path of length $n - 1$.