Edge general position problem

Paul Manuel, R. Prabha, Sandi Klavžar

Given a graph $G$, the general position problem is to find a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is called a…