Even-diameter order conjecture for chordal ring graphs
Statement
Let be a chordal ring graph with diameter , and let denote the maximum number of vertices among chordal ring graphs of diameter . For even , the conjecture concerns the largest possible order of such a graph. Even-diameter chordal-ring conjecture. The maximum number of vertices of a chordal ring graph with an even diameter is
The bound is known for even diameter, but cannot be attained when ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.