Bounded-diameter conjecture for finite Goldbach graphs
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 up to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.