We consider edge colourings of the complete r-uniform hypergraph K (r) n on n vertices. How many colours may such a colouring have if we restrict the number of colours locally? The local restriction is formulated as follows: for a fixed hypergraph H and an integer k we call a colouring (H, k)-local if every copy of H in the complete hypergraph K (r) n receives at most k different colours. We in...