The Erdős–Rogers function asymptotic conjecture
Statement
For integers , let be the largest integer such that every -vertex -free graph has an induced -free subgraph with at least vertices. The Erdős–Rogers function conjecture. For all , as ,
The source presents this as a tentative conjecture, contrasting it with the known order of magnitude of . The supplied status evidence proves this statement, so its database status is solved.
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.