ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a finite Goldbach graph be a finite graph associated with Goldbach representations, and let a finite near Goldbach graph be a finite graph obtained from the corresponding near Goldbach construction. Bounded-diameter conjecture for finite Goldbach graphs. The diameters of finite Goldbach graphs and finite near Goldbach graphs are bounded by a constant. The paper reports computational evidence that both types of graph are connected with diameter at most 55 up to 1000010000 vertices, but no general bound is established.

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.