Ethan Shallcross
YOU?
Author Swipe
View article: Solution to some conjectures on mobile position problems
Solution to some conjectures on mobile position problems Open
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$-path $P$ we have $S \cap V(P) = \{ u,v\} $, whereas the mutu…