Is there a $3$ -uniform hypergraph on $n$ vertices which contains at least $n - O (1)$ different sizes of cliques (maximal complete subgraphs)

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved