Tuite–Thomas–Chartrand circulant-graph conjecture

Let nn be the order of a graph, and let a circulant graph be a graph whose vertices and adjacency relation are invariant under cyclic translation. Let mp(G)\operatorname{mp}(G) denote the monophonic position number and diam(G)\operatorname{diam}(G) the diameter. Tuite–Thomas–Chartrand's conjecture. For any n11n\geq 11, there is a circulant graph with order nn, monophonic position number two, and diameter two.

The construction preceding the conjecture preserves these properties while changing the order; the existence of a circulant example for every n11n\geq 11 remains open.

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.