Erdős Problem #667
Statement
Let be fixed integers. We define to be the largest such that any graph on vertices where every set of vertices spans at least edges must contain a complete graph on vertices. Is a strictly increasing function of for ?
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.