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.
机构:
School of Mathematical Sciences, University of Science and Technology of ChinaSchool of Mathematical Sciences, University of Science and Technology of China
Jun Gao
Hongliang Lu
论文数: 0引用数: 0
h-index: 0
机构:
School of Mathematics and Statistics, Xi'an Jiaotong UniversitySchool of Mathematical Sciences, University of Science and Technology of China
Hongliang Lu
Jie Ma
论文数: 0引用数: 0
h-index: 0
机构:
School of Mathematical Sciences, University of Science and Technology of ChinaSchool of Mathematical Sciences, University of Science and Technology of China
Jie Ma
Xingxing Yu
论文数: 0引用数: 0
h-index: 0
机构:
School of Mathematics, Georgia Institute of TechnologySchool of Mathematical Sciences, University of Science and Technology of China
机构:
Univ Roma La Sapienza, Dipartimento Matemat, Piazzale Aldo Moro 2, I-00185 Rome, ItalyUniv Roma La Sapienza, Dipartimento Matemat, Piazzale Aldo Moro 2, I-00185 Rome, Italy
Rajola, Sandro
Tallini, Maria Scafati
论文数: 0引用数: 0
h-index: 0
机构:
Univ Roma La Sapienza, Dipartimento Matemat, Piazzale Aldo Moro 2, I-00185 Rome, ItalyUniv Roma La Sapienza, Dipartimento Matemat, Piazzale Aldo Moro 2, I-00185 Rome, Italy