Solution to some conjectures on mobile position problems

Ethan Shallcross, James Tuite, Aoise Evans +2

The general position problem for graphs asks for the largest number of vertices in a subset $S\subseteq V(G)$ of a graph $G$ such that for any $u,v\in S$ and any shortest $u,v$-p…