On rainbow-free colourings of uniform hypergraphs
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....
Prif Awduron: | , |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Elsevier
2021
|