ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,p)G(n,p) be the Erdős–Rényi random graph, where p=p(n)p=p(n) is the probability that each possible edge is present, and choose a random embedding of a random graph G∈G(n,p)G\in G(n,p). Let F(G)F(G) denote the number of faces of the embedding.

Erdős–Rényi face conjecture. The expected number of faces is

(1+o(1))ln⁡(pn2).(1+o(1))\ln(pn^2).

This gives a precise logarithmic prediction for the expected number of faces in the Erdős–Rényi model. The supplied text presents it as a conjecture following the general logarithmic-bound discussion, and no resolution is given.

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.