diff --git a/luku12.tex b/luku12.tex
index 726f7be..2679627 100644
--- a/luku12.tex
+++ b/luku12.tex
@@ -461,7 +461,7 @@ surely contains a cycle.
 A graph is bipartite if its nodes can be colored
 using two colors so that there are no adjacent
 nodes with the same color.
-It is suprisingly easy to check if a graph
+It is surprisingly easy to check if a graph
 is bipartite using graph traversal algorithms.
 
 The idea is to color the starting node blue,