The extremal characterization of global amoeba graphs of minimum degree one
Statement
Let be a global amoeba graph of order and minimum degree . Let denote its number of edges, let be the floor of , and let be the graph defined in Example 2(c) of the source.
Extremal global amoeba conjecture.
if and only if .
The graph is shown to have the largest density among global amoebas of minimum degree ; the conjecture asserts that it is the unique graph attaining this extremal edge count, up to isomorphism.
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.