Kraus–Dehmer–Schaumann's highly connected minimal-entropy conjecture
Statement
Let be a graph on vertices, and let denote the entropy associated with the sphere function. A graph is highly connected here when it is obtained from the complete graph by removing a small number of edges.
Kraus–Dehmer–Schaumann's conjecture. A minimal graph for is highly connected. In particular, a minimal graph on vertices has at least vertices of degree .
The conjecture is motivated by computations for graphs on and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.