Erdős Problem #804 — Global independence from local logarithmic independence
Statement
Let be the largest integer such that every -vertex graph whose every induced -vertex subgraph has an independent set of size at least must itself have an independent set of size at least . Estimate and .
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.