ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each minimum degree δ≥4\delta\geq4, let f(δ)f(\delta) and f′(δ)f'(\delta) 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 δ≥4\delta\geq4,

f(δ)=f′(δ).f(\delta)=f'(\delta).

The conjecture is motivated by the exact computations for δ=4,5,6\delta=4,5,6, where the optimal repeatable graphs have equal chromatic and clique numbers; the supplied text gives no resolution for general δ\delta.

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.