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)…
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.