hw5: Reduce number of vertices

Lipen · Mar 5, 2024 · 5711cd6 · 5711cd6
1 parent 44813bd
commit 5711cd6
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/hw5.tex b/hw5.tex
@@ -324,7 +324,7 @@
     \end{subtasks}
 
 
-    \item Draw all pairwise non-isomorphic unlabeled unrooted trees on 7 vertices.
+    \item Draw all pairwise non-isomorphic unlabeled unrooted trees on 6 vertices.
 
 
     \item Consider the following algorithm (let's call it \enquote{Algorithm S}) for finding a minimum spanning tree from a connected weighted simple graph $G = \Pair{V, E}$ by successively adding groups of edges.