Large almost monochromatic subsets in hypergraphs

David Conlon, Jacob Fox, Benny Sudakov

We show that for all $\ell$ and $\epsilon >0$ there is a constant $c=c(\ell ,\epsilon )>0$ such that every $\ell$-coloring of the triples of an $N$-element set contains a subset $S$ of size $c\sqrt…