Logarithmic face conjecture for Erdős–Rényi random graphs
Statement
Let be the Erdős–Rényi random graph, where is the probability that each possible edge is present, and choose a random embedding of a random graph . Let denote the number of faces of the embedding.
Erdős–Rényi face conjecture. The expected number of faces is
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.