Color avoidance for monotone paths

Article excerpt

The number of vertices needed to guarantee a colour-avoiding tight monotone path in every r-coloured complete k-uniform hypergraph is exponentially smaller than the number needed for a monochromatic path.