ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers t>s≥2t>s\geq2, let fs,t(n)f_{s,t}(n) be the largest integer mm such that every nn-vertex KtK_t-free graph has an induced KsK_s-free subgraph with at least mm vertices. The Erdős–Rogers function conjecture. For all s≥3s\geq3, as n→∞n\to\infty,

fs,s+1(n)=n (log⁡n)1−o(1).f_{s,s+1}(n)=\sqrt n\,(\log n)^{1-o(1)}.

The source presents this as a tentative conjecture, contrasting it with the known order of magnitude of f2,3(n)f_{2,3}(n). 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.