1 problem

A $3$-graph $F$ is layered if there is a function $f:V(F)\to\mathbb N$ such that: every edge has exactly one vertex whose label is strictly greater than the other two; edges with t…