当前位置: X-MOL 学术Theor. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On rainbow-free colourings of uniform hypergraphs
Theoretical Computer Science ( IF 0.9 ) Pub Date : 2021-06-17 , DOI: 10.1016/j.tcs.2021.06.022
Ragnar Groot Koerkamp , Stanislav Živný

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=(k1)(lnn)/n is the threshold function for the existence of a rainbow-free colouring in a random k-uniform hypergraph.



中文翻译:

关于均匀超图的无彩虹着色

我们研究k均匀超图的无彩虹着色;也就是说,使用k种颜色但具有没有超边达到所有颜色的属性的着色。我们证明=(-1)(输入n)/n是随机k均匀超图中存在无彩虹着色的阈值函数。

更新日期:2021-06-17
down
wechat
bug