ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite simple undirected graph on nn vertices, and let L(G)\mathcal{L}(G) denote the probability that the uniform sequential attachment process outputs a graph isomorphic to GG. The conjecture states that, for every nn and every graph GG on nn vertices, L(G)≥L ⁣(K⌊n/2⌋,⌈n/2⌉)\mathcal{L}(G)\geq \mathcal{L}\!\left(K_{\lfloor n/2\rfloor,\lceil n/2\rceil}\right); equivalently, the balanced complete bipartite graph uniquely minimises the graph likelihood among graphs of order nn.

Record

Added
Links

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.