Thomas's cubic-graph monophonic position conjecture

Let GG be a cubic graph of order nn, and let mp(G)\operatorname{mp}(G) denote its monophonic position number. Thomas's conjecture. The largest possible monophonic position number of a cubic graph with order nn is

n3+O(n).\frac{n}{3}+O(n).

This conjecture was suggested by computational results; the stated asymptotic form remains unresolved in the survey.

Sources & referencesView supporting material

Primary source

Ullas Chandran S. V., Sandi Klavžar and James Tuite, “The General Position Problem: A Survey”, arXiv:2501.19385 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.