On rainbow-free colourings of uniform hypergraphs
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)( n)/n is the threshold function for the existence of a rainbow-free colouring in a random k-uniform hypergraph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.