Does there exist an absolute constant $c > 0$ such that, for all $r \geq 2$ , in any $r$ -uniform hypergraph with chromatic number $3$ there is a vertex contained in at least $(1 + c)^{r}$ many edges?

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved