Erdős Problem #1014
Statement
Let be the Ramsey number, so the minimal such that every graph on at least vertices contains either a or an independent set on vertices. Prove, for fixed , that
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.