Mobile general position number complexity

Determine the computational complexity of finding the mobile general position number \(\mob(G)\).

Background

Mobile general position sets model robots moving through a graph while maintaining the general-position condition. Although values are known for several graph families, the computational complexity of determining the maximum number of mobile robots remains unresolved.

References

It seems difficult to approach the complexity question for mobile general position sets, and this remains an open problem.

— The General Position Problem: A Survey  (2501.19385 - V. et al., 31 Jan 2025) in Section 6, subsection “Mobile position sets”