Ononot — A matching in a graph is a set of edges with no common verti

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

Graph Theoryeasy

0:00.0

A matching in a graph is a set of edges with no common vertices. What is the maximum matching in $K_{2,3}$ ?