On the Erd{\H o}s--Hajnal problem in the case of 3-graphs

arXiv1905.02893MaRDI QIDQ6318379FDOQ6318379

Authors: Danila Cherkashin 

Publication date: 7 May 2019

Abstract: Let $m(n,r)$ denote the minimal number of edges in an $n$-uniform hypergraph which is not $r$-colorable. For the broad history of the problem see [RaiSh]. It is known that for a fixed $n$ the sequence [ frac{m(n,r)}{r^n} ] has a limit. The only trivial case is $n=2$ in which $$. In this note we focus on the case $n=3$. First, we compare the existing methods in this case and then improve the lower bound.

This page was built for publication: On the Erd{\H o}s--Hajnal problem in the case of 3-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6318379)