Beginner
Discrete Mathematics & Math
Q39 / 100
What is a bipartite graph?
Correct! Well done.
Incorrect.
The correct answer is B) A graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other
B
Correct Answer
A graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other
Explanation
Bipartite graphs (2-colorable): no odd-length cycles. Used for matching problems (job assignments, marriage problem). König's theorem: in bipartite graphs, max matching = min vertex cover.
Progress
39/100