Abstract
We study rainbow-free colourings of k-uniform hypergraphs; that is, colourings that use k colours but with the property that no hyperedge attains all colours. We show that p⁎=(k−1)(lnn)/n is the threshold function for the existence of a rainbow-free colouring in a random k-uniform hypergraph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have