Conjecture that the two repetition ratios agree
Statement
For each minimum degree , let and denote the two repetition ratios defined in the paper for the diameter problem under the relevant clique- or chromatic-number condition.
Repetition-ratio conjecture. For every ,
The conjecture is motivated by the exact computations for , where the optimal repeatable graphs have equal chromatic and clique numbers; the supplied text gives no resolution for general .
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.