Past exam of the Probability, statistics and options II course of the University of Oxford / 2011 / R / R2 / d / ii

Table of contents
- Solution ii

Solution

In the complete graph every pair of vertices is adjacent, so all

n

colours assigned to vertices must be distinct. Choose colours successively, leaving one fewer choice at each step. Thus

P_{K_{n}} (k) = k (k - 1) \dots (k - n + 1) .

For nonnegative integer

k < n

the product is zero, as required.

 Ancestors (13)

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version