On rainbow-free colourings of uniform hypergraphs

被引：2
|
作者：
Koerkamp, Ragnar Groot [1 ]
Zivny, Stanislav [1 ]
机构：
[1] Univ Oxford, Oxford, England
来源：
THEORETICAL COMPUTER SCIENCE | 2021年 / 885卷
基金：
欧洲研究理事会;
关键词：
Random hypergraphs; Rainbow-free colourings; No-rainbow colourings; COMPLEXITY;
D O I：
10.1016/j.tcs.2021.06.022
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：69 / 76
页数：8
相关论文
共 50 条
  • [31] Rainbow Turan numbers of matchings and forests of hyperstars in uniform hypergraphs
    Li, Tong
    Tang, Yucong
    Yan, Guiying
    Zhou, Wenling
    DISCRETE MATHEMATICS, 2023, 346 (09)
  • [32] On locally rainbow colourings
    Janzer, Barnabas
    Janzer, Oliver
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 169 : 134 - 149
  • [33] Connected Colourings of Complete Graphs and Hypergraphs
    Leader, Imre
    Tan, Ta Sheng
    GRAPHS AND COMBINATORICS, 2016, 32 (01) : 257 - 269
  • [34] Density conditions for panchromatic colourings of hypergraphs
    Kostochka, AV
    Woodall, DR
    COMBINATORICA, 2001, 21 (04) : 515 - 541
  • [35] Density conditions for panchromatic colourings of hypergraphs
    Kostochka A.V.
    Woodall D.R.
    Combinatorica, 2001, 21 (4) : 515 - 541
  • [36] Connected Colourings of Complete Graphs and Hypergraphs
    Imre Leader
    Ta Sheng Tan
    Graphs and Combinatorics, 2016, 32 : 257 - 269
  • [37] Book free 3-uniform hypergraphs
    Ghosh, Debarun
    Gyori, Ervin
    Nagy-Gyorgy, Judit
    Paulos, Addisu
    Xiao, Chuanqi
    Zamora, Oscar
    DISCRETE MATHEMATICS, 2024, 347 (03)
  • [38] Co-degree threshold for rainbow perfect matchings in uniform hypergraphs
    Lu, Hongliang
    Wang, Yan
    Yu, Xingxing
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2023, 163 : 83 - 111
  • [39] On almost-regular edge colourings of hypergraphs
    Bryant, Darryn
    ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (04):
  • [40] On Colourings of Hypergraphs Without Monochromatic Fano Planes
    Lefmann, Hanno
    Person, Yury
    Rodl, Vojtech
    Schacht, Mathias
    COMBINATORICS PROBABILITY & COMPUTING, 2009, 18 (05): : 803 - 818
12345