ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, and let If2(G)I_{f^2}(G) 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 nn.

Kraus–Dehmer–Schaumann's conjecture. A graph minimizing If2(G)I_{f^2}(G) for the exponential sequence is a tree. Moreover, it is a generalized star of diameter approximately 2n\sqrt{2n} and therefore has approximately 2n\sqrt{2n} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.