5 problems

Let $G$ be a graph, and let ${\rm gp}_{\rightarrow}(G)$ denote the minimum general position number over all orientations of $G$. The lower-number-two hardness conjecture. It is NP-…

Let $G$ be a graph, and let … be its general position spectrum. The interval-spectrum conjecture. The set $S_{{\rm gp}}(G)$ is an interval of integers. The spectrum is an interval…

Let $G$ be a graph and let $x$ be a vertex that is not a cut vertex of $G$. Write ${\rm gp}_{\rm o}(G)$ for the outer general position number of $G$ and $\deg_G(x)$ for the degree…

Terminal set existence conjecture. Every graph has a terminal set.

The lower general position product bound.