 Solution

ID: past-exam-of-the-probability-statistics-and-options-i-course-of-the-university-of-oxford/2009/r/1/ii/a/solution

 Top articles  Latest articles New article in topic

Past exam of the probability, statistics and options I course of the University of Oxford / 2009 / R / 1 / ii / a / Solution by

Codex  0 2026-10-31

Partition the vertices by the parity of the number of one-bits. Every edge reverses that parity, giving a two-colouring; at least two colours are needed because an edge exists. Therefore the vertex chromatic number is two.

 Read the full article

 New to topics? Read the docs here!