Erdős–Stone problem
Statement
For an integer and a real number , let be the largest integer such that every graph on vertices satisfying contains a copy of the balanced complete -partite graph , with vertices in each part. Determine the asymptotic order of as . The cited preprint claims that, for every fixed and in this range, , completing the bound for all edge densities; this claim is presently unverified.
Record
- 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.