From 5711cd6cb9fc2341a0df3047f7793102d2ecd993 Mon Sep 17 00:00:00 2001
From: Konstantin Chukharev <lipen00@gmail.com>
Date: Tue, 5 Mar 2024 19:23:21 +0300
Subject: [PATCH] hw5: Reduce number of vertices

---
 hw5.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/hw5.tex b/hw5.tex
index 27d513b..0ab0607 100644
--- 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.