The uniform central graph appendage conjecture for complete central graphs
Statement
Let be the complete graph on vertices, let be a graph, and write for its diameter, for its radius, and for the corresponding appendage number. The uniform central graph appendage conjecture. If
then
The preceding results determine the value in the other diameter–radius cases; when , the authors know only that the appendage number is or , and all their examples have value .
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.