On the Number of Precolouring Extensions

We investigate the number of proper λ -colourings of a hypergraph extending a given proper precolouring. We prove that this number agrees with a polynomial in λ for any sufficiently largeλ , and we establish a generalization of Whitney’s broken circuit theorem by applying a recent improvement of the inclusion–exclusion principle.