aboutsummaryrefslogtreecommitdiff
path: root/content
diff options
context:
space:
mode:
authorAdrian Kummerlaender2018-03-01 14:49:44 +0100
committerAdrian Kummerlaender2018-03-01 14:49:44 +0100
commitb69625a5fb01e835a754aad84709ae1de3135b69 (patch)
tree91054912dc506f337da3b61f8ddfe4d6595a1030 /content
parent65accaf8e4b7814a136afc15762c9e2d02bd1e33 (diff)
downloadmath_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.tar
math_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.tar.gz
math_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.tar.bz2
math_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.tar.lz
math_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.tar.xz
math_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.tar.zst
math_reference_sheets-b69625a5fb01e835a754aad84709ae1de3135b69.zip
Fix mistake in Graph theory digest
Diffstat (limited to 'content')
-rw-r--r--content/graph_theory.tex2
1 files changed, 1 insertions, 1 deletions
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}