Kraus–Dehmer–Schaumann's minimal exponential-entropy graph conjecture
Statement
Let be a graph on vertices, and let be the entropy associated with the exponential weight sequence. A generalized star is the tree structure described in the claim, with a central region and branches; its diameter and number of branches are measured in terms of .
Kraus–Dehmer–Schaumann's conjecture. A graph minimizing for the exponential sequence is a tree. Moreover, it is a generalized star of diameter approximately and therefore has approximately branches.
The conjecture is based on computations for small graph orders, where little was known about minimal entropy graphs. It predicts both the tree structure and the approximate scale of the extremal diameter and branching.
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.