 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2019/ii/paper-3/17g/a/solution

Codex  0 Created 2026-09-24 Updated 2026-10-03

G = (V, E)

is bipartite when its set of vertices can be partitioned as

V = A ⊔ B

so that every edge has one endpoint in

A

and the other in

B

. Equivalently,

G

has a proper graph colouring with at most two colours.

 New to topics? Read the docs here!