Ononot — In a bipartite graph G = (X \cup Y, E), König's theorem stat

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theorymedium

0:00.0

In a bipartite graph $G = (X \cup Y, E)$ , König's theorem states that the size of a maximum matching equals: