On rainbow-free colourings of uniform hypergraphs

DOI10.1016/J.TCS.2021.06.022MaRDI QIDQ6370176arXivFDO

Authors Ragnar Groot Koerkamp, S. Zivny

Publication date 13 June 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.TCS.2021.06.022

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

arXiv classification

cs.DMmath.CO

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^{\ast }=(k-1)(lnn)/n$ is the threshold function for the existence of a rainbow-free colouring in a random $k$-uniform hypergraph.

This page was built for publication: On rainbow-free colourings of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6370176)