2 problems

Given a graph $G$, let its obstacle number be the minimum number of faces in a straight-line drawing whose union intersects every non-edge, and let $f(h,n)$ denote the number of…

Obstacle-number graph-counting conjecture. The number of such graphs satisfies