ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CR(N,c)CR(N,c) be a chordal ring graph with diameter kk, and let N(k)N(k) denote the maximum number of vertices among chordal ring graphs of diameter kk. For even k>2k>2, the conjecture concerns the largest possible order of such a graph. Even-diameter chordal-ring conjecture. The maximum number NN of vertices of a chordal ring graph with an even diameter k>2k>2 is

N=3k22−k.N=\frac{3k^2}{2}-k.

The bound N(k)=3k22N(k)=\frac{3k^2}{2} is known for even diameter, but cannot be attained when k>2k>2; the conjecture proposes the exact next-best value.

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.