Suppose there are a number of committees of people, which we represent by vertices of a graph and draw an edge between two vertices if those committees share a common member. Then the list-colouring number is (informally) the minimum number k so that as long as each committee comes up with a list of k-many […]
Read More