What is the maximum number of edges in the maximum matching of a bipartite graph with n vertices?
Shouldn’t the answer be (n*n)/4
What is the maximum number of edges in the maximum matching of a bipartite graph with n vertices?
Shouldn’t the answer be (n*n)/4
Hello @omkarkhodwe,
Yes, there might be a mistake in the question. I’ll convey the same to your mentors.