Lower General Position Sets in Graphs

Gabriele Di Stefano, Sandi Klavžar, Aditi Krishnakumar +2

A subset $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of $S$. In this paper, we generalise a problem o…