ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For fixed 0 less than p less than 1, does a random graph G in G(n,p) satisfy f_min(G) at least a constant times n/log n with high probability; what is the maximum f_min(G) over n-vertex graphs; and is f_min(G)=o(n) for every G in G(n) or G(n,n)?

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.