On rainbow-free colourings of uniform hypergraphs

06/13/2021
by   Ragnar Groot Koerkamp, et al.
0

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

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/13/2020

A generalization of the Kővári-Sós-Turán theorem

We present a new proof of the Kővári-Sós-Turán theorem that ex(n, K_s,t)...
03/11/2019

Partite Turán-densities for complete r-uniform hypergraphs on r+1 vertices

In this paper we investigate density conditions for finding a complete r...
03/14/2018

On the connectivity threshold for colorings of random graphs and hypergraphs

Let Ω_q=Ω_q(H) denote the set of proper [q]-colorings of the hypergraph ...
04/08/2021

Heterogeneous Dense Subhypergraph Detection

We study the problem of testing the existence of a heterogeneous dense s...
08/25/2021

Matchings on Random Regular Hypergraphs

We prove the convergence in probability of free energy for matchings on ...
10/04/2021

Hypergraph regularity and random sampling

Suppose a k-uniform hypergraph H that satisfies a certain regularity ins...
01/12/2021

Sharp detection boundaries on testing dense subhypergraph

We study the problem of testing the existence of a dense subhypergraph. ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.