1 problem

Let $G$ be an almost bipartite non-König–Egerváry graph, and let $C$ be its unique odd cycle. A maximum matching of $G$ is a matching with the largest possible number of edges. Lev…