1 problem

Let $\mathcal{H}$ be a planar $3$-uniform hypergraph on $n$ vertices, and let its shadow be the graph obtained by replacing each hyperedge by the edges joining its pairs of vertice…