AI Chat AI Image Generator AI Video Text to Speech

On rainbow-free colourings of uniform hypergraphs

06/13/2021

∙

by Ragnar Groot Koerkamp, et al.

∙

∙

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.

Ragnar Groot Koerkamp
2 publications
Stanislav Zivny
37 publications

page 1

page 2

page 3

page 4

research

∙ 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)...

0 Jesse Geneson, et al. ∙

research

∙ 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...

0 Klas Markström, et al. ∙

research

∙ 04/08/2021

Heterogeneous Dense Subhypergraph Detection

We study the problem of testing the existence of a heterogeneous dense s...

0 Mingao Yuan, et al. ∙

research

∙ 08/25/2021

Matchings on Random Regular Hypergraphs

We prove the convergence in probability of free energy for matchings on ...

0 Zhongyang Li, et al. ∙

research

∙ 10/04/2021

Hypergraph regularity and random sampling

Suppose a k-uniform hypergraph H that satisfies a certain regularity ins...

0 Felix Joos, et al. ∙

research

∙ 10/01/2020

Hypergraph regularity and higher arity VC-dimension

We generalize the fact that graphs with small VC-dimension can be approx...

0 Artem Chernikov, et al. ∙

research

∙ 12/12/2022

Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings

We show that the threshold for the binomial random 3-partite, 3-uniform ...

0 Vishesh Jain, et al. ∙