diff options
| -rw-r--r-- | content/graph_theory.tex | 2 |
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} |