From b69625a5fb01e835a754aad84709ae1de3135b69 Mon Sep 17 00:00:00 2001
From: Adrian Kummerlaender
Date: Thu, 1 Mar 2018 14:49:44 +0100
Subject: Fix mistake in Graph theory digest

---
 content/graph_theory.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/content/graph_theory.tex b/content/graph_theory.tex
index ff3f873..de31f61 100644
--- a/content/graph_theory.tex
+++ b/content/graph_theory.tex
@@ -108,7 +108,7 @@ Any $k$-regular bipartite graph has a perfect matching and a proper $k$-edge col
 
 \subsection*{König's Theorem}
 
-For bipartite $G$ the size of the smallest matching equals the size of a smallest vertex cover.
+For bipartite $G$ the size of the largest matching equals the size of a smallest vertex cover.
 
 \subsection*{Hajnal and Szemer\'{e}di}
 
-- 
cgit v1.2.3