The uniform central graph appendage conjecture for central graphs of diameter greater than one
Statement
Let and be graphs, let and denote their diameters, let denote the radius of , and let be the corresponding appendage number. The uniform central graph appendage conjecture. If
and
then
The preceding results show that in this case the appendage number is either or ; value would occur exactly when a certain covering number equals , but no such example was found and impossibility was not proved.
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.