Erdős Problem #911
Statement
Let denote the size Ramsey number, the minimal number of edges such that there is a graph with edges that is Ramsey for . Is there a function such that as such that, for all large , if is a graph with vertices and edges then ", "difficulty": "L1" },{
Record
- Source
- Added
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.