ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph on nn vertices, and let Ifσ(G)I_{f^\sigma}(G) denote the entropy associated with the sphere function. A graph is highly connected here when it is obtained from the complete graph KnK_n by removing a small number of edges.

Kraus–Dehmer–Schaumann's conjecture. A minimal graph for Ifσ(G)I_{f^\sigma}(G) is highly connected. In particular, a minimal graph on nn vertices has at least m≥n/2m\geq n/2 vertices of degree n−1n-1.

The conjecture is motivated by computations for graphs on 88 and 99 vertices and by the observed structure of minimal graphs. It predicts that extremal graphs for this entropy are close to complete and contain many universal vertices.

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.