Balanced complete-bipartite graph likelihood conjecture
Statement
Let be a finite simple undirected graph on vertices, and let denote the probability that the uniform sequential attachment process outputs a graph isomorphic to . The conjecture states that, for every and every graph on vertices, ; equivalently, the balanced complete bipartite graph uniquely minimises the graph likelihood among graphs of order .
Record
- Added
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.