ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an integer, and let a circulant graph mean a graph whose vertices are arranged cyclically with adjacency determined by a fixed set of cyclic differences. The monophonic position number is denoted by aa, and the diameter by DD. Circulant graph conjecture. For any n≥11n\geq 11, there is a circulant graph with order nn, monophonic position number a=2a=2, and diameter D=2D=2. The preceding theorem establishes existence of some graph with these parameters if and only if n∈{3,4,5,8}n\in\{3,4,5,8\} or n≥11n\geq 11; the conjecture strengthens the large-order existence assertion by requiring the graph to be circulant, based on computational evidence.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.